Sciweavers

58 search results - page 6 / 12
» Abstract DPLL and Abstract DPLL Modulo Theories
Sort
View
MEMOCODE
2010
IEEE
13 years 5 months ago
A flexible schema for generating explanations in lazy theory propagation
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...
Roberto Bruttomesso, Edgar Pek, Natasha Sharygina
ASIAN
2009
Springer
274views Algorithms» more  ASIAN 2009»
13 years 8 months ago
Reducing Equational Theories for the Decision of Static Equivalence
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
PLILP
1998
Springer
13 years 11 months ago
A Compiler for Rewrite Programs in Associative-Commutative Theories
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
Pierre-Etienne Moreau, Hélène Kirchn...
CADE
2008
Springer
14 years 7 months ago
Towards SMT Model Checking of Array-Based Systems
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
CSL
2004
Springer
14 years 15 days ago
Unsound Theorem Proving
Abstract. Applications in software verification often require determining the satisfiability of first-order formulæ with respect to some background theories. During development...
Christopher Lynch