35 search results - page 6 / 7 » Rewriting Induction Linear Arithmetic = Decision Procedure |
CADE
2007
Springer
15 years 9 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
113
click to vote
FROCOS
2011
Springer
13 years 9 months ago
2011
Springer
A dominant approach to Satisfiability Modulo Theories (SMT) relies on the integration of a Conflict-Driven-Clause-Learning (CDCL) SAT solver and of a decision procedure able to h...
SIGSOFT
2006
ACM
15 years 3 months ago
2006
ACM
Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to contr...
LATA
2009
Springer
15 years 4 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
CAV
2003
Springer
15 years 2 months ago
2003
Springer
Many verification problems reduce to proving the validity of formulas involving both propositional connectives and domain-specific functions and predicates. This paper presents ...