Predicate Abstraction in a Program Logic Calculus

Authors:
Benjamin Weiß
Affiliations:
Institute for Theoretical Computer Science, University of Karlsruhe, Karlsruhe, Germany D-76128
Venue:
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Year:
2009

Citing 16
Cited 2

An axiomatic basis for computer programming

Communications of the ACM
Dynamically Discovering Likely Program Invariants to Support Program Evolution

IEEE Transactions on Software Engineering - Special issue on 1999 international conference on software engineering
Predicate abstraction for software verification

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Experience with Predicate Abstraction

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Counterexample-Guided Abstraction Refinement

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Simplify: a theorem prover for program checking

Journal of the ACM (JACM)
Preliminary design of JML: a behavioral interface specification language for java

ACM SIGSOFT Software Engineering Notes
Logical Interpretation: Static Program Analysis Using Theorem Proving

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Verifying object-oriented programs with KeY: a tutorial

FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
Verification of object-oriented software: The KeY approach

Verification of object-oriented software: The KeY approach
Boogie: a modular reusable verifier for object-oriented programs

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Sequential, parallel, and quantified updates of first-order structures

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Loop invariants on demand

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Dynamic logic with non-rigid functions: a basis for object-oriented program verification

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning

Interleaving symbolic execution and partial evaluation

FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Predicate abstraction in a program logic calculus

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Predicate abstraction is a form of abstract interpretation where the abstract domain is constructed from a finite set of predicates over the variables of the program. This paper explores a way to integrate predicate abstraction into a calculus for deductive program verification, where it allows to infer loop invariants automatically that would otherwise have to be given interactively. The approach has been implemented as a part of the KeY verification system.