44 search results - page 5 / 9 » Counterexamples with Loops for Predicate Abstraction |
180
Voted
POPL
2010
ACM
16 years 4 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
352
Voted
POPL
2005
ACM
16 years 7 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
193
Voted
CAV
2005
Springer
16 years 29 days ago
2005
Springer
Abstract. In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, sof...
212
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
191
click to vote
CADE
2007
Springer
16 years 7 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...