63 search results - page 2 / 13 » Predicate Abstraction via Symbolic Decision Procedures |
CAV
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Separation Logic consists of a Boolean combination of predicates of the form vi ≥ vj +c where c is a constant and vi, vj are variables of some ordered infinite type li...
CAV
2006
Springer
13 years 8 months ago
2006
Springer
niques for Fast Predicate Abstraction Shuvendu K. Lahiri , Robert Nieuwenhuis , and Albert Oliveras Abstract. Predicate abstraction is a technique for automatically exfinite-state ...
FMCAD
2009
Springer
13 years 8 months ago
2009
Springer
Abstract--The theory of arrays is ubiquitous in the context of software and hardware verification and symbolic analysis. The basic array theory was introduced by McCarthy and allow...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Abstract. We address the general problem of determining the validity of boolean combinations of equalities and inequalities between real-valued expressions. In particular, we consi...
CADE
2007
Springer
14 years 4 months ago
2007
Springer
In this paper we propose a method for inferring invariants for loops in Java programs. An example of a simple while loop is used throughout the paper to explain our approach. The m...