Sökning: "Satisfiability Solver"
Visar resultat 1 - 5 av 6 avhandlingar innehållade orden Satisfiability Solver.
1. Symbolic Trajectory Evaluation using a Satisfiability Solver
Sammanfattning : .... LÄS MER
2. Semantics, Decision Procedures, and Abstraction Refinement for Symbolic Trajectory Evaluation
Sammanfattning : The rapid growth in hardware complexity has led to a need for formal verification of hardware designs to prevent bugs from entering the final silicon. Model-checking is a verification method in which a model of a system is checked against a property, describing the desired behaviour of the system over time. LÄS MER
3. Using Formal Methods for Product and Production Development -- Industrial Applications for Boolean Satisfiability Solvers
Sammanfattning : Highly customized products and frequent changes in the production systems pose high demands on engineers. The amount of data and the complexity of the relations within the data are high. Thus, it is both error-prone and time consuming to analyze the data without software support. LÄS MER
4. SAT Based Model Checking
Sammanfattning : This Thesis is a study of automatic reasoning about finite state machines (FSMs). Two techniques used in hardware verification are presented. In both, the verification is carried out by a translation of the problem into propositional logic. Satisfiability and validity of propositional formulas are decided by the use of a SAT solver. LÄS MER
5. Extending the Automated Reasoning Toolbox
Sammanfattning : Due to the semi-decidable nature of first-order logic, it can be desirable to address a wider range of problems than the standard ones of satisfiability and derivability. We extend the automated reasoning toolbox by introducing three new tools for analysing problems in first-order logic. Infinox aims to show finite unsatisfiability, i.e. LÄS MER