Name
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 maximally-weak preconditions for safety assertions. An interesting application of maximally-weak precondition generation is to produce maximally-general counterexamples for safety assertions. We also present preliminary experimental evidence demonstrating the feasibility of this technique. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-540-93900-9_13 | VMCAI |
Keywords | Field | DocType |
formula yield,maximally-weak precondition,predicate abstraction,maximally-weak precondition generation,constraint-based methodology,predicate p,constraint-based invariant generation technique,constraint-based invariant inference,boolean formula,boolean indicator variable,safety assertion,satisfiability,weakest precondition | Predicate abstraction,Inference,Abstract interpretation,Computer science,Theoretical computer science,Precondition,Invariant (mathematics),Predicate (grammar),True quantified Boolean formula,Predicate (mathematical logic) | Conference |
Volume | ISSN | Citations |
5403 | 0302-9743 | 19 |
PageRank | References | Authors |
0.92 | 19 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sumit Gulwani | 1 | 2263 | 110.91 |
| Saurabh Srivastava | 2 | 184 | 19.27 |
| Ramarathnam Venkatesan | 3 | 1326 | 111.13 |