Paper Info
Title
Constraint solving for program verification: theory and practice by example
Abstract
Program verification relies on the construction of auxiliary assertions describing various aspects of program behaviour, e.g., inductive invariants, resource bounds, and interpolants for characterizing reachable program states, ranking functions for approximating number of execution steps until program termination, or recurrence sets for demonstrating non-termination. Recent advances in the development of constraint solving tools offer an unprecedented opportunity for the efficient automation of this task. This tutorial presents a series of examples illustrating algorithms for the automatic construction of such auxiliary assertions by utilizing constraint solvers as the basic computing machinery, and optimizations that make these constraint-based algorithms work well in practice.
Year
DOI
Venue
2010
10.1007/978-3-642-14295-6_7
computer aided verification
Keywords
DocType
Volume
program behaviour,program verification,reachable program state,automatic construction,constraint-based algorithm,efficient automation,utilizing constraint solvers,approximating number,program termination,basic computing machinery,auxiliary assertion
Conference
6174
ISSN
ISBN
Citations 
0302-9743
3-642-14294-X
4
PageRank 
References 
Authors
0.43
8
1
Name
Order
Citations
PageRank
Andrey Rybalchenko1143968.53