DMCA
Constraint-based Invariant Inference over Predicate Abstraction
Cached
Download Links
| Citations: | 23 - 2 self |
BibTeX
@MISC{Gulwani_constraint-basedinvariant,
author = {Sumit Gulwani and Saurabh Srivastava and Ramarathnam Venkatesan},
title = {Constraint-based Invariant Inference over Predicate Abstraction},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. This paper describes a constraint-based invariant generation technique for proving the validity of safety assertions over the domain of predicate abstraction in an interprocedural setting. The key idea of the technique is to represent each invariant in bounded DNF form by means of boolean indicator variables, one for each predicate p and each disjunct d denoting whether p is present in d or not. The verification condition of the program is then encoded by means of a boolean formula over these boolean indicator variables such that any satisfying assignment to the formula yields the inductive invariants for proving the validity of given program assertions. This paper also describes how to use the constraint-based methodology for generating weakest preconditions for safety assertions. An interesting application of weakest precondition generation is to produce mostgeneral counterexamples for safety assertions. We also present preliminary experimental evidence demonstrating the feasibility of this technique. 1
Keyphrases
predicate abstraction constraint-based invariant inference safety assertion boolean indicator variable inductive invariant constraint-based invariant generation technique preliminary experimental evidence boolean formula interesting application constraint-based methodology verification condition satisfying assignment interprocedural setting key idea precondition generation program assertion mostgeneral counterexample bounded dnf form
