45 search results - page 3 / 9 » A Tutorial on Satisfiability Modulo Theories |
109
click to vote
CADE
2007
Springer
15 years 9 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
CADE
2007
Springer
15 years 9 months ago
2007
Springer
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
ICFEM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We study the problem of generating a database and parameters for a given parameterized SQL query satisfying a given test condition. We introduce a formal background theor...
IANDC
2006
14 years 9 months ago
2006
Many approaches to deciding the satisfiability of quantifier free formulae with respect to a background theory T -- also known as Satisfiability Modulo Theory, or SMT
MEMOCODE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--Theory propagation in Satisfiability Modulo Theories is crucial for the solver's performance. It is important, however, to pay particular care to the amount of deduc...