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 70 for “"Constraint Solving"”.

  1. Extensible adaptation via constraint solving

    … of the language is the ability to express constraints among the objects to be transmitted. Policies can: make ordering constraints, such as "all text objects are transmitted before any image objects"; express rules on the relative bandwidth allocations across objects of different types; …

    rice Repository record for Extensible adaptation via constraint solving (opens in a new tab)

  2. Neuronové sítě pro string constraint solving

    Táto práca skúma možnosti optimalizácie formálnych metód používaných pri riešení reťazcových obmedzení pomocou neurónových sietí. Zaoberáme sa konkrétne nástrojom Z3-noodler vyvíjaným tímom Verifit na VUT FIT v Brne. Najskôr vysvetľujeme potrebné prerekvizity v podobe definícií a predstavujeme …

    brno-tech Repository record for Neuronové sítě pro string constraint solving (opens in a new tab)

  3. Constraint Solving for Diagnosing Concurrency Bugs

    … In this work, we propose a logical constraint-based symbolic analysis method to aid in the diagnosis of concurrency bugs and find their root causes, which can be later used to recommend repairs. In our method, the diagnosis process is formulated as a set of constraint solving …

    vt Repository record for Constraint Solving for Diagnosing Concurrency Bugs (opens in a new tab)

  4. Constraint Solving for User Interface Layout Problems

    … proposes efficient and robust algorithms for solving linear constraints problems for graphical user interface (GUI) layout. Constraints have been recognised as a powerful method for the specification of GUI layouts for a long time. Most constraint problems encountered in this area are sparse, …

    auckland-ms Repository record for Constraint Solving for User Interface Layout Problems (opens in a new tab)

  5. Constraint Solving and Optimizationn Using Nature-Inspired Techniques

    Constraint solving and optimization is tackled by scientists in almost every area, including scheduling and planning, configuration, resource allocation, finance, computational biology and machine learning. Since classical systematic and mathematical methods cannot effectively provide suitable …

    regina Repository record for Constraint Solving and Optimizationn Using Nature-Inspired Techniques (opens in a new tab) Download PDF for Constraint Solving and Optimizationn Using Nature-Inspired Techniques (opens in a new tab)

  6. Exposing and addressing machine learning brittleness through constraint solving

    … inconsistent, and prone to overfitting; however, constraint solving can be used to systematically expose, quantify, and address this brittleness.</p><p>This dissertation first establishes that widely-used implementations of popular ML algorithms are nondeterministic (producing different outputs on …

    njit Repository record for Exposing and addressing machine learning brittleness through constraint solving (opens in a new tab)

  7. Use of constraint solving for testing software product lines

    … In this dissertation, we show how modern constraint solvers can be used to tackle the challenge of efficiently ensuring dependability in SPLs from two perspectives: sampling and reuse. In sampling, the key is to choose a subset of products that are representative of the whole configuration …

    nebraska Repository record for Use of constraint solving for testing software product lines (opens in a new tab)

  8. String constraint solving pro automatickém generování testů pro simulinkové modely

    Verifikace softwaru v bezpečnostně kritických systémech, jako jsou systémy řízení letu, vyžaduje rigorózní procesy, včetně zajištění sledovatelnosti od požadavků k testovacím vektorům. Navrhujeme způsob, jak plně využít SMT řešič Z3-Noodler pro automatické generování testovacích vektorů na základě …

    brno-tech Repository record for String constraint solving pro automatickém generování testů pro simulinkové modely (opens in a new tab)

  9. Korat-API : an API for building constraint solving problems for Korat

    … introduces the foundation of an API for building constraint solving problems for the Korat solver for imperative predicates. Our goal is two-fold: (1) to facilitate the use of Korat as a backend solver for applications that desire using it as a constraint solving engine; and (2) to facilitate …

    texas Repository record for Korat-API : an API for building constraint solving problems for Korat (opens in a new tab)

  10. Parallelizing Path Exploration and Optimizing Constraint Solving for Efficient Symbolic Execution

    … condition, and checks the path's feasibility by solving its corresponding path condition using off-the-shelf constraint solvers. Symbolic execution is a powerful program analysis technique and has provided a basis for various software testing and verification techniques. However, it remains …

    texas-state Repository record for Parallelizing Path Exploration and Optimizing Constraint Solving for Efficient Symbolic Execution (opens in a new tab)

  11. Constraints, a model of computation

    In this thesis constraint solving/satisfaction is presented as a model of computation. Advantages of using constraints as a paradigm of programming are presented. A semantic schema for constraint based computations is given, following a brief survey of the more important systems based on …

    vt Repository record for Constraints, a model of computation (opens in a new tab)

  12. SAT-based String Solving

    String constraint solving is the task of checking whether first-order formulas over strings are satisfiable.Because strings are a core data type in nearly every programming language, reliable and efficient solvers are essential in many areas of formal verification. This thesis studies methods for …

    cau-kiel Repository record for SAT-based String Solving (opens in a new tab)

  13. Integrating ASP and CLP systems: Computing answer sets from partially ground programs

    … for constructing complex reasoning systems. Constraint logic programming (CLP) emerged as an alternate paradigm through the fusion of logic programming and constraint solving. A CLP solver thus integrates resolution techniques from logic programming and constraint solving techniques from …

    ttu Repository record for Integrating ASP and CLP systems: Computing answer sets from partially ground programs (opens in a new tab)

  14. Milao : a novel framework for mixed imperative and declarative formulation and solving of structural constraints

    Advances in constraint solving and increases in processing power have enabled new approaches for automating specification-based testing. However, writing specifications and scaling techniques that utilize them remain challenging. We introduce Milao -- a novel framework for mixed imperative and …

    texas Repository record for Milao : a novel framework for mixed imperative and declarative formulation and solving of structural constraints (opens in a new tab)

  15. Program analysis for machine learning models

    … and repair techniques like model counting and constraint solving can be applied to the field of machine learning to solve these problems. This insight enables us to propose i) a set of tools and techniques which can precisely quantify the extent to which machine learning models have learned and …

    texas Repository record for Program analysis for machine learning models (opens in a new tab)

  16. Formal Verification-based Design Model Repair

    … derive from the B-method, model checking, constraint solving, machine learning and automatic programming. We use the B-method to specify design models as abstract machines. Faults in the abstract machines are detected using model checking techniques. To eliminate detected faults, we suggest …

    auckland-ms Repository record for Formal Verification-based Design Model Repair (opens in a new tab)

  17. Improving the Efficiency of Graph-Based Static Analysis

    … flows, which is usually conducted in the form of solving dynamic transitive closure on the abstract graph of programs. The inefficiency arises from not only the high complexity of transitive closure itself but also the high redundancies of the analysis techniques. This dissertation studies …

    uts Repository record for Improving the Efficiency of Graph-Based Static Analysis (opens in a new tab)

  18. Παράλληλα συστήματα λογικού προγραμματισμού με υποστήριξη περιορισμών

    … the standard unification process of LP with constraint solving, a solution that led to the introduction of constraint logic programming (CLP). The above two solutions are orthogonal in the sense that they can exist simultaneously in a system, thus leading to the creation of parallel …

    greece Repository record for Παράλληλα συστήματα λογικού προγραμματισμού με υποστήριξη περιορισμών (opens in a new tab)

  19. 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)

Page 1 of 4