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 68 for “"satisfiability modulo theories"”.

  1. Inductive logic programming as satisfiability modulo theories

    … is that <em>LFF frames the ILP problem as one of Satisfiability Modulo Theories (SMT)</em>. With the search for viable hypotheses handed-off to a SAT-solver, the test stage can be regarded as a theory solver collaborating with the SAT-solver, effectively making ILP’s notion of background knowledge …

    oxford Repository record for Inductive logic programming as satisfiability modulo theories (opens in a new tab)

  2. 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

  3. Synthesis and Verification of Models using Satisfiability Modulo Theories

    … tools. The key idea in this thesis is the use of satisfiability modulo theories (SMT) solvers to boost the synthesis and verification capabilities of existing MDD tools. The scope of this work is twofold. First, we propose a synthesis approach using SMT that takes as input a structural model of a …

    queens Repository record for Synthesis and Verification of Models using Satisfiability Modulo Theories (opens in a new tab)

  4. Encoding The Lexicographic Ordering Constraint in Satisfiability Modulo Theories

    In this thesis we present nine different SMT encodings for the Lexicographic Ordering Constraint Lex, These constraints are helpful in breaking some kinds of symmetries in decision problems. The encodings are drawn from the constraint solving literature or is a variant of such. This thesis aims to …

    whiterose Download PDF for Encoding The Lexicographic Ordering Constraint in Satisfiability Modulo Theories (opens in a new tab)

  5. Single Event Multiple Transient Analysis using Satisfiability Modulo Theories

    … effects of SEMTs on digital circuits based on Satisfiability Modulo Theories (SMT). The presented technique considers the layout-based adjacencies as SEMT originating sites and includes the effects of logical, electrical, and temporal masking while propagating the SEMT faults in the circuit. …

    concordia Download PDF for Single Event Multiple Transient Analysis using Satisfiability Modulo Theories (opens in a new tab)

  6. Planning and Robust Execution for Hybrid Systems via Satisfiability Modulo Theories

    … encoding the planning problem as Satisfiability Modulo Theory (SMT) formulas. This is the first SMT encoding that can handle the whole set of PDDL+ features and deal with non-linear polynomial continuous changes without discretisation. This allows it to generate plans with non-linear dynamics that …

    kings Repository record for Planning and Robust Execution for Hybrid Systems via Satisfiability Modulo Theories (opens in a new tab) Download PDF for Planning and Robust Execution for Hybrid Systems via Satisfiability Modulo Theories (opens in a new tab)

  7. Analysis of Single Event Upsets Propagation at Register Transfer Level in Combinational and Sequential Circuits Based on Satisfiability Modulo Theories

    … at the Register Transfer Level (RTL) using Satisfiability Modulo Theories (SMT). The propagation of SEUs through RTL bit-vector constructs is modeled as a Satisfiability problem using the SMT theory of bit-vectors. At first, for combinational designs, two different analysis techniques, …

    concordia Download PDF for Analysis of Single Event Upsets Propagation at Register Transfer Level in Combinational and Sequential Circuits Based on Satisfiability Modulo Theories (opens in a new tab)

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

  9. Nástroj pro generování testovacích cest dle zadaného kritéria

    … pokrytí. Tyto cesty převádí na odpovídající SMT (Satisfiability Modulo Theories) formuli pro kterou se ověří její sémantická splnitelnost SMT řešičem Z3. Pro sémanticky splnitelné cesty je zároveň vygenerováno ohodnocení vstupů, pro které formule platí. Tato ohodnocení dohromady tvoří sadu …

    brno-tech Repository record for Nástroj pro generování testovacích cest dle zadaného kritéria (opens in a new tab)

  10. Optimization Modulo Theories with OptiMathSAT

    … Verification (FV) and Automated Reasoning (AR), Satisfiability Modulo Theories (SMT) is an important discipline that allows for dealing with industrial-level decision problems. Optimization Modulo Theories (OMT) extends Satisfiability Modulo Theories with the ability to express, and optimize, …

    trento Repository record for Optimization Modulo Theories with OptiMathSAT (opens in a new tab)

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

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

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

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

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

  16. Machine learning for function synthesis

    … thesis, we consider synthesis in the context of satisfiability modulo theories. Within this domain, the goal is to synthesise mathematical expressions that adhere to abstract logical formulas. These types of synthesis problems find many applications in the field of computer-aided verification. …

    oxford Repository record for Machine learning for function synthesis (opens in a new tab)

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

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

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

  20. StringFuzz: A Fuzzer for 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 solvers need testing. The developers of solvers commonly test them with …

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

Page 1 of 4