63 search results - page 1 / 13 » Predicate Abstraction via Symbolic Decision Procedures |
CAV
2005
Springer
13 years 10 months ago
2005
Springer
LPAR
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We describe a novel decision procedure for Quantified Boolean Formulas (QBFs) which aims to unleash the hidden potential of quantified reasoning in applications. The Sk...
VMCAI
2010
Springer
13 years 11 months ago
2010
Springer
POPL
2011
ACM
12 years 7 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
HYBRID
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. This paper describes the implementation of predicate abstraction techniques to automatically compute symbolic backward reachable sets of high dimensional piecewise affine...