Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 40 for “"Constraint solver"”.

  1. Imperative constraint solver prediction and analysis

    … to grow. A powerful form of analysis is based on constraint solving where logical constraints char- acterize desired properties of code and solutions to the constraints are desired program states. For example, a rogram’s precondition constraint characterizes the valid inputs to the program. While …

    texas Repository record for Imperative constraint solver prediction and analysis (opens in a new tab)

  2. A Field Programmable Gate Array Based Finite-Domain Constraint Solver

    Constraint satisfaction and optimization techniques are commonly employed in scheduling, industrial manufacturing, and automation processes where concepts from Operations Research (OR) and Artificial Intelligence (AI) are applied. In embedded systems, Constraint Satisfaction Problem (CSP) finds use …

    utahstate Repository record for A Field Programmable Gate Array Based Finite-Domain Constraint Solver (opens in a new tab)

  3. A General Pluggable Type Inference Framework and its use for Data-flow Analysis

    … Inference, a framework that aims to provide a constraint-based type inference for pluggable types, can generate type constraints over the occurrence of type qualifier of expressions according to type rules. However, there is no efficient approach to solve type constraints generated by Checker …

    waterloo Repository record for A General Pluggable Type Inference Framework and its use for Data-flow Analysis (opens in a new tab)

  4. Constraint-Based Thread-Modular Abstract Interpretation

    In this dissertation, I present a set of novel constraint-based thread-modular abstract-interpretation techniques for static analysis of concurrent programs. Specifically, I integrate a lightweight constraint solver into a thread-modular abstract interpreter to reason about inter-thread …

    vt Repository record for Constraint-Based Thread-Modular Abstract Interpretation (opens in a new tab)

  5. Characterizing software components using evolutionary testing and path-guided analysis

    … and natural selection, can be combined with a constraint solver to target specific paths in the software. Secondly, this thesis demonstrates how such an approach can identify local minima and maxima execution times, which can provide a more detailed characterization of software performance. The …

    iupui Repository record for Characterizing software components using evolutionary testing and path-guided analysis (opens in a new tab)

  6. Solver Tuning with Genetic Algorithms

    Currently the parameters in a constraint solver are often selected by hand by experts in the field; these parameters might include the level of preprocessing to be used, the variable ordering heuristic or the suitable modelling approach. The efficient and automatic mechanism of parameters tuning …

    dundee Repository record for Solver Tuning with Genetic Algorithms (opens in a new tab) Download PDF for Solver Tuning with Genetic Algorithms (opens in a new tab)

  7. Generating customized layouts automatically

    … directed and undirected graphs. It integrates a constraint solver to process constraints. Compared with other works, LYCA has several distinctive features: The force-directed placement algorithm is improved to generate compact layouts for graphs with large vertices.; A novel usage of the …

    hawaii Repository record for Generating customized layouts automatically (opens in a new tab)

  8. SAT Compilation for Constraints over Structured Finite Domains

    A constraint is a formula in first-order logic expressing a relation between values of various domains. In order to solve a constraint, constructing a propositional encoding is a successfully applied technique that benefits from substantial progress made in the development of modern SAT solvers. …

    qucosa-diss

  9. Constraint satisfaction - an alternate approach to unification in Prolog

    … In this thesis, we study the incorporation of a constraints solver into Prolog. The generalization of unification into a constraints satisfaction algorithm allows the incorporation of function evaluation into unification. Constraint satisfaction is used to replace unification thus enhancing the …

    vt Repository record for Constraint satisfaction - an alternate approach to unification in Prolog (opens in a new tab)

  10. Analýza vybraných bezpečnostních protokolů

    Tato bakalářská práce se zabývá nástrojem SRI Constraint Solver, určeným pro analýzu bezpečnostních protokolů. Nástroj je v práci stručně charakterizován, a jeho syntaxe předvedena na implementaci protokolu Needham-Schroeder Public Key. Praktická část uvádí příklady analyzovaných protokolů. Pro …

    brno-tech Repository record for Analýza vybraných bezpečnostních protokolů (opens in a new tab)

  11. Developing 5GL Concepts from User Interactions

    … a developer could be said to act as a constraint solver, similar to those used by a 5th Generation Language(5GL). This thesis presents the hypothesis that 5GL linguistic mechanics, such as facts, rules and goals, will be emergent in the communications of developer pairs performing Test …

    gvsu Repository record for Developing 5GL Concepts from User Interactions (opens in a new tab)

  12. Probabilistic Finite Domains

    … the Logic Programming paradigm with a novel constraint solver. In doing so, we are able to take advantage of the knowledge representation power of probability. In particular we investigate: first, the duality of the two interpretations of probability to the problems researchers face when …

    city-london Download PDF for Probabilistic Finite Domains (opens in a new tab)

  13. A mathematical framework for a general purpose constraint management system

    The use of constraints in engineering for designing complex models is very popular. Current constraint solvers are divided into two broad classes: general and domain specific. Those that are general can handle very general constraint problems but are typically slow; while those that are domain …

    whiterose Download PDF for A mathematical framework for a general purpose constraint management system (opens in a new tab)

  14. CONC++ : a constraint extension to the C++ programming language

    … toolkits currently in use provide some type of constraint system. Constraint systems automatically maintain relationships between variables in an application without explicit instructions from the programmer. CONC++ provides a constraint system independent of a GUI toolkit. Specifically, it …

    ut-knoxville Repository record for CONC++ : a constraint extension to the C++ programming language (opens in a new tab)

  15. Formal Verification of Concurrent Embedded Software

    … to check the model is a newly developed interval constraint solver with an embedded memory model. MEMICS is able to detect common runtime errors, like e. g., a division by zero, as well as concurrent ones, like e. g., a critical race condition.

    cau-kiel Repository record for Formal Verification of Concurrent Embedded Software (opens in a new tab)

  16. Formal Verification of Concurrent Embedded Software

    … to check the model is a newly developed interval constraint solver with an embedded memory model. MEMICS is able to detect common runtime errors, like e. g., a division by zero, as well as concurrent ones, like e. g., a critical race condition.

    cau-kiel Repository record for Formal Verification of Concurrent Embedded Software (opens in a new tab)

  17. Automated Reasoning of Database Queries

    … correlated sub- queries, and integrity constraints. Also, this semantics is denotational and only adds a few equational axioms, as the interpretation of SQL, to semirings. Then, to check the equivalences, Cosette uses this semantics to encode a pair of input SQL queries in both an …

    washington Repository record for Automated Reasoning of Database Queries (opens in a new tab)

  18. Dynamically weakened constraints in bounded search for constraint optimisation problems

    … of solutions of a problem involving resources, constraints on how these resources can be used, and a ranking of solutions are of both theoretical and practical interest. Many real world problems (such as routing vehicles or planning timetables) can be modelled as constraint optimisation …

    glasgow Repository record for Dynamically weakened constraints in bounded search for constraint optimisation problems (opens in a new tab) Download PDF for Dynamically weakened constraints in bounded search for constraint optimisation problems (opens in a new tab)

  19. Evaluation of String Constraint Solvers Using Dynamic Symbolic Execution

    … generation. Symbolic execution tools rely on constraint solvers to determine the feasibility of program paths and generate concrete inputs for feasible paths. Therefore, the effectiveness of such tools depends on their constraint solvers. Most modern constraint solvers for primitive data …

    boise Repository record for Evaluation of String Constraint Solvers Using Dynamic Symbolic Execution (opens in a new tab)

  20. Reformulation of global constraints

    … to design and analysis of algorithms for global constraints. Global constraints are one of the major contributors to the success of modern constraint solvers in solving combinatorial and industrial problems. They serve as natural building blocks in the modelling stage providing the user with a …

    unsw Repository record for Reformulation of global constraints (opens in a new tab)

Page 1 of 2