Program verification using templates over predicate abstraction

Srivastava, Saurabh; Gulwani, Sumit

doi:10.1145/1542476.1542501

Cited by 95 publications

(99 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One is a collection of 4 examples where quantified reasoning over the array content is needed. These examples are taken from [13,15] and involve common array operations, such as initialization, copying and sortedness (Table 1). The other one is a collection of 175 problems (Table 2), extracted from the bounded model checking of device drivers [12].…”

Section: Methodsmentioning

confidence: 99%

Tree Interpolation in Vampire

Blanc

Gupta

Kovács

et al. 2013

Logic for Programming, Artificial Intelligence, and Reasoning

View full text Add to dashboard Cite

Abstract. We describe new extensions of the Vampire theorem prover for computing tree interpolants. These extensions generalize Craig interpolation in Vampire, and can also be used to derive sequence interpolants. We evaluated our implementation on a large number of examples over the theory of linear integer arithmetic and integer-indexed arrays, with and without quantifiers. When compared to other methods, our experiments show that some examples could only be solved by our implementation.

show abstract

Section: Methodsmentioning

confidence: 99%

Tree Interpolation in Vampire

Blanc

Gupta

Kovács

et al. 2013

Logic for Programming, Artificial Intelligence, and Reasoning

View full text Add to dashboard Cite

show abstract

“…[10,21,30,33]. E-HSF implementation of EncodeValidity supporting linear arithmetic inequalities is directly inspired by these techniques, and puts them to work for existential properties.…”

Section: Related Workmentioning

confidence: 99%

Solving Existentially Quantified Horn Clauses

Beyene

Popeea

Rybalchenko

2013

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. Temporal verification of universal (i.e., valid for all computation paths) properties of various kinds of programs, e.g., procedural, multi-threaded, or functional, can be reduced to finding solutions for equations in form of universally quantified Horn clauses extended with well-foundedness conditions. Dealing with existential properties (e.g., whether there exists a particular computation path), however, requires solving forall-exists quantified Horn clauses, where the conclusion part of some clauses contains existentially quantified variables. For example, a deductive approach to CTL verification reduces to solving such clauses. In this paper we present a method for solving forall-exists quantified Horn clauses extended with well-foundedness conditions. Our method is based on a counterexample-guided abstraction refinement scheme to discover witnesses for existentially quantified variables. We also present an application of our solving method to automation of CTL verification of software, as well as its experimental evaluation.

show abstract

“…Classical abstract interpretation [32] and its applications such as automated assertion discovery [33,34,35,36] mainly focus on finding numerical program properties. Our work is complementary to these advances as our focus is more on refining specifications for heap-manipulating programs.…”

Section: Related Workmentioning

confidence: 99%

Automatically refining partial specifications for heap-manipulating programs

Qin

Luo

et al. 2014

Science of Computer Programming

View full text Add to dashboard Cite

Automatically verifying heap-manipulating programs is a challenging task, especially when dealing with complex data structures with strong invariants, such as sorted lists and AVL/red-black trees. The verification process can greatly benefit from human assistance through specification annotations, but this process requires intellectual effort from users and is error-prone. In this paper, we propose a new approach to program verification that allows users to provide only partial specification to methods. Our approach will then refine the given annotation into a more complete specification by discovering missing constraints. The discovered constraints may involve both numerical and multi-set properties that could be later confirmed or revised by users. We further augment our approach by requiring partial specification to be given only for primary methods. Specifications for loops and auxiliary methods can then be systematically discovered by our augmented mechanism, with the help of information propagated from the primary methods. Our work is aimed at verifying beyond shape properties, with the eventual goal of analysing full functional properties for pointer-based data structures. Initial experiments have confirmed that we can automatically refine partial specifications with non-trivial constraints, thus making it easier for users to handle specifications with richer properties.

show abstract

Program verification using templates over predicate abstraction

Cited by 95 publications

References 28 publications

Tree Interpolation in Vampire

Tree Interpolation in Vampire

Solving Existentially Quantified Horn Clauses

Automatically refining partial specifications for heap-manipulating programs

Contact Info

Product

Resources

About