Constraint solving for program verification: theory and practice by example

Authors:
Andrey Rybalchenko
Affiliations:
Technische Universität München
Venue:
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Year:
2010

Citing 5
Cited 0

Proving non-termination

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From Tests to Proofs

TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Invariant synthesis for combined theories

VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Constraint solving for interpolation

Journal of Symbolic Computation
Hierarchic reasoning in local theory extensions

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

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 paper presents a series of examples illustrating algorithms for the automatic construction of such auxiliary assertions by utilizing constraint solvers as the basic computing machinery.