Sciweavers

SAS
2005
Springer
162views Formal Methods» more  SAS 2005»
13 years 9 months ago
Boolean Heaps
We show that the idea of predicates on heap objects can be cast in the framework of predicate abstraction. This leads to an alternative view on the underlying concepts of three-val...
Andreas Podelski, Thomas Wies
KBSE
2007
IEEE
13 years 10 months ago
Model checking concurrent linux device drivers
toolkit demonstrates that predicate abstraction enables automated verification of real world Windows device Our predicate abstraction-based tool DDVerify enables the automated ve...
Thomas Witkowski, Nicolas Blanc, Daniel Kroening, ...
KBSE
2008
IEEE
13 years 10 months ago
Program Analysis with Dynamic Precision Adjustment
We present and evaluate a framework and tool for combining multiple program analyses which allows the dynamic (on-line) adjustment of the precision of each analysis depending on t...
Dirk Beyer, Thomas A. Henzinger, Grégory Th...
TACAS
2009
Springer
134views Algorithms» more  TACAS 2009»
13 years 10 months ago
Compositional Predicate Abstraction from Game Semantics
ional Predicate Abstraction from Game Semantics Adam Bakewell and Dan R. Ghica University of Birmingham, U.K. We introduce a technique for using conventional predicate abstraction ...
Adam Bakewell, Dan R. Ghica
ICCAD
2004
IEEE
191views Hardware» more  ICCAD 2004»
14 years 16 days ago
Checking consistency of C and Verilog using predicate abstraction and induction
edicate Abstraction and Induction Edmund Clarke Daniel Kroening June 25, 2004 CMU-CS-04-131 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 It is common...
Daniel Kroening, Edmund M. Clarke
CADE
2007
Springer
14 years 4 months ago
Inferring Invariants by Symbolic Execution
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...
Benjamin Weiß, Peter H. Schmitt
POPL
2005
ACM
14 years 4 months ago
Transition predicate abstraction and fair termination
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...
Andreas Podelski, Andrey Rybalchenko
CADE
2009
Springer
14 years 4 months ago
Interpolation and Symbol Elimination
Abstract. We prove several results related to local proofs, interpolation and suion calculus and discuss their use in predicate abstraction and invariant generation. Our proofs and...
Andrei Voronkov, Laura Kovács