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 49 for “"Satisfiability Modulo Theories (SMT)"”.

  1. SAT modulo monotonic theories

    Satisfiability Modulo Theories (SMT) solvers are a class of efficient constraint solvers which form integral parts of many algorithms. Over the years, dozens of different Satisfiability Modulo Theories solvers have been developed, supporting dozens of different logics. However, there are still many …

    ubc Repository record for SAT modulo monotonic theories (opens in a new tab) Download PDF for SAT modulo monotonic theories (opens in a new tab)

  2. A Constraint-Based Approach to Reactive Task and Motion Planning

    … candidate. For efficient verification, we employ Satisfiability Modulo Theories (SMT) solvers using a new extension of proof rules for Temporal Property Verification. For efficient policy search, we apply domain-specific heuristics to generalize verification failures. Furthermore, the SMT solver …

    rice Repository record for A Constraint-Based Approach to Reactive Task and Motion Planning (opens in a new tab)

  3. Quantum Optimization of Physician Scheduling For Maximal Healthcare Capacity

    … Linear Programming (MILP) with Gurobi and Satisfiability Modulo Theories (SMT) with Z3, are implemented as benchmarks and used to establish feasible, constraint-satisfying solutions. The PSP is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem, which serves as input …

    chalmers Repository record for Quantum Optimization of Physician Scheduling For Maximal Healthcare Capacity (opens in a new tab)

  4. Verification of programs with Z3

    … would reduce human interaction to the minimum. Satisfiability Modulo Theories (SMT) solvers, a series of SAT-solvers such as Z3 looked initially to be a proper and easy to use tool. Its syntax is fairly uncomplicated and it seems to be quite efficient. In this thesis, Z3 is used to find loop …

    mcmaster Repository record for Verification of programs with Z3 (opens in a new tab)

  5. An Effective SMT Engine for Formal Verification

    … verification is based on the exploitation of Satisfiability Modulo Theories (SMT) solvers. In this thesis, we present MathSAT, a modern, efficient SMT solver that provides several important functionalities, and can be used as a workhorse engine in formal verification. We develop novel …

    trento Repository record for An Effective SMT Engine for Formal Verification (opens in a new tab)

  6. An Effective SMT Engine for Formal Verification

    … verification is based on the exploitation of Satisfiability Modulo Theories (SMT) solvers. In this thesis, we present MathSAT, a modern, efficient SMT solver that provides several important functionalities, and can be used as a workhorse engine in formal verification. We develop novel …

    trento Repository record for An Effective SMT Engine for Formal Verification (opens in a new tab)

  7. Exploits in Concurrency for Boolean Satisfiability

    Boolean Satisfiability (SAT) is a problem that holds great theoretical significance along with effective formulations that benefit many real-world applications. While the general problem is NP-complete, advanced solver algorithms and heuristics allow for fast solutions to many large industrial …

    vt Repository record for Exploits in Concurrency for Boolean Satisfiability (opens in a new tab)

  8. Partitioning Strategies to Enhance Symbolic Execution

    … have been proposed in the past, the number of Satisfiability Modulo Theories (SMT) solver calls for reaching a target is still large, resulting in longer execution times for programs containing many paths. In this paper, we present two partitioning strategies in order to mitigate this problem, …

    vt Repository record for Partitioning Strategies to Enhance Symbolic Execution (opens in a new tab)

  9. Combining SMT with theorem proving for AMS verification : analytically verifying global convergence of a digital PLL

    … support such verification, I integrated the Z3 “satisfiability modulo theories” (SMT) solver into the ACL2 theorem prover. The capabilities of these two tools are largely complementary – Z3 provides fully automated reasoning about boolean formulas, linear and non-linear systems of equalities, and …

    ubc Repository record for Combining SMT with theorem proving for AMS verification : analytically verifying global convergence of a digital PLL (opens in a new tab) Download PDF for Combining SMT with theorem proving for AMS verification : analytically verifying global convergence of a digital PLL (opens in a new tab)

  10. StringFuzz: A Fuzzer for String SMT Solvers

    … a software tool for automatically testing string SMT solvers. String SMT solvers are specialised software tools for solving the Satisfiability Modulo Theories (SMT) problem with string contraints, which is a type of constraint satisfaction problem applicable in industry. Like all tools, string SMT …

    waterloo Repository record for StringFuzz: A Fuzzer for String SMT Solvers (opens in a new tab)

  11. Automated Metamodel Instance Generation Satisfying Quantitative Constraints

    … that combines both graph representation and Satisfiability Modulo Theories (SMT) to the problem of metamodel instance generation. The solution consists of two approaches, the first approach presents a new foundation for generating metamodel instances by translating a metamodel to an SMT …

    maynooth Download PDF for Automated Metamodel Instance Generation Satisfying Quantitative Constraints (opens in a new tab)

  12. Incremental Linearization for Satisfiability and Verification Modulo Nonlinear Arithmetic and Transcendental Functions

    Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a first-order formula with respect to some theory or combination of theories; Verification Modulo Theories (VMT) is the problem of analyzing the reachability for transition systems represented in terms of SMT …

    trento Repository record for Incremental Linearization for Satisfiability and Verification Modulo Nonlinear Arithmetic and Transcendental Functions (opens in a new tab)

  13. Verification of Hybrid Systems using Satisfiability Modulo Theories

    … and the validation of hybrid systems using Satisfiability Modulo Theories (SMT). SMT is an established technique that has been used successfully in many verification approaches, targeted for both hardware and software systems. The use of SMT to verify hybrid systems has been limited, due to …

    trento Repository record for Verification of Hybrid Systems using Satisfiability Modulo Theories (opens in a new tab) Restricted access

  14. Optimal and Suboptimal Scheduling of the Dual Resource Job Shop Problem with Multi-Skilled Workforce

    … (MILP) formulation implemented in Gurobi, a satisfiability modulo theories (SMT) formulation implemented in Z3, a constraint programming (CP) model using Google OR-Tools CP-SAT, a genetic algorithm (GA), and a greedy priority-rule heuristic. The models incorporate sequence-dependent setup and …

    chalmers Repository record for Optimal and Suboptimal Scheduling of the Dual Resource Job Shop Problem with Multi-Skilled Workforce (opens in a new tab)

  15. Nelson Oppen combination as a rewrite theory

    Solving Satisfiability Modulo Theories (SMT) problems in a key piece in automating tedious mathematical proofs. It involves deciding satisfiability of formulas of a decidable theory, which can often be reduced to solving systems of equalities and disequalities, in a variety of theories such as …

    uiuc Repository record for Nelson Oppen combination as a rewrite theory (opens in a new tab)

  16. Data-Driven Methods for System Identification and Lyapunov Stability

    … structure consists of two neural networks and a satisfiability modulo theories (SMT) solver. The first neural network is responsible for learning the unknown dynamics. The second neural network aims to identify a valid Lyapunov function and a provably stabilizing nonlinear controller. The SMT …

    waterloo Repository record for Data-Driven Methods for System Identification and Lyapunov Stability (opens in a new tab)

  17. Z3str4: A Solver for Theories over Strings

    Satisfiability Modulo Theories (SMT) solvers supporting rich theories of strings have facilitated numerous industrial applications with the need to reason about string operations and predicates that are present in many popular programming languages. Constraints encountered in practical applications …

    waterloo Repository record for Z3str4: A Solver for Theories over Strings (opens in a new tab)

  18. Analog and Mixed Signal Verification using Satisfiability Solver on Discretized Models

    … equations for the given circuit and applying Satisfiability Modulo Theories (SMT) solver to determine a region that encloses complete DC equilibrium of the circuit. The technique is applied to an example circuit and the results are analyzed in turns of runtime effectiveness.

    unlv Repository record for Analog and Mixed Signal Verification using Satisfiability Solver on Discretized Models (opens in a new tab) Download PDF for Analog and Mixed Signal Verification using Satisfiability Solver on Discretized Models (opens in a new tab)

  19. Liquid Haskell: Haskell as a theorem prover

    … check correctness of specifications via Satisfiability Modulo Theories (SMT) solvers requiring no explicit proofs or complicated annotations. Finally, the specification language is arbitrary expressive, allowing the user to write general correctness properties about their code, thus …

    greece Repository record for Liquid Haskell: Haskell as a theorem prover (opens in a new tab)

  20. Semantics-Aware Understanding and Handling of Security and Privacy Problems in Smart Environments

    … of cross-app interference threats and designed a Satisfiability modulo theories (SMT)-based solution to detect them. In another work, we revealed a family of delay-based automation interference attacks that cause cross-rule interference problems in multi-platform multi-path systems. We also …

    temple Repository record for Semantics-Aware Understanding and Handling of Security and Privacy Problems in Smart Environments (opens in a new tab)

Page 1 of 3