Satisfiability modulo theories
Abstract Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)
We first introduce Abstract DPLL, a rule-based formulation of the Davis--Putnam--Logemann-
-Loveland (DPLL) procedure for propositional satisfiability. This abstract framework allows …
-Loveland (DPLL) procedure for propositional satisfiability. This abstract framework allows …
DPLL(T): Fast Decision Procedures
H Ganzinger, G Hagen, R Nieuwenhuis… - … Aided Verification: 16th …, 2004 - Springer
The logic of equality with uninterpreted functions (EUF) and its extensions have been widely
applied to processor verification, by means of a large variety of progressively more …
applied to processor verification, by means of a large variety of progressively more …
Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW
We compare SAT-checkers and decision diagrams on the evalua-tion of Boolean formulas
produced in the formal verification of both correct and buggy versions of superscalar and …
produced in the formal verification of both correct and buggy versions of superscalar and …
DPLL (T) with exhaustive theory propagation and its application to difference logic
R Nieuwenhuis, A Oliveras - … , CAV 2005, Edinburgh, Scotland, UK, July 6 …, 2005 - Springer
At CAV'04 we presented the DPLL (T) approach for satisfiability modulo theories T. It is
based on a general DPLL (X) engine whose X can be instantiated with different theory …
based on a general DPLL (X) engine whose X can be instantiated with different theory …
Satisfiability modulo theories
Applications in artificial intelligence, formal verification, and other areas have greatly
benefited from the recent advances in SAT. It is often the case, however, that applications in …
benefited from the recent advances in SAT. It is often the case, however, that applications in …
Efficient translation of Boolean formulas to CNF in formal verification of microprocessors
MN Velev - ASP-DAC 2004: Asia and South Pacific Design …, 2004 - ieeexplore.ieee.org
We present a method for translating Boolean formulas to CNF by identifying gates with
fanout count of 1, and merging them with their fanout gate to generate a single set of …
fanout count of 1, and merging them with their fanout gate to generate a single set of …
A method for symbolic computation of abstract operations
This paper helps to bridge the gap between (i) the use of logic for specifying program
semantics and performing program analysis, and (ii) abstract interpretation. Many operations …
semantics and performing program analysis, and (ii) abstract interpretation. Many operations …
A comprehensive study and analysis on SAT-solvers: advances, usages and achievements
Boolean satisfiability (SAT) has been studied for the last twenty years. Advances have been
made allowing SAT solvers to be used in many applications including formal verification of …
made allowing SAT solvers to be used in many applications including formal verification of …
Incremental SAT-based method with native Boolean cardinality handling for the Hamiltonian cycle problem
The Hamiltonian cycle problem (HCP) is the problem of finding a spanning cycle in a given
graph. HCP is NP-complete and has been known as an important problem due to its close …
graph. HCP is NP-complete and has been known as an important problem due to its close …