An integrated proof language for imperative programs

An integrated proof language for imperative programs

Cached

Download Links

by Karen Zee , Viktor Kuncak , Martin C. Rinard

Venue:	In PLDI’09
Citations:	9 - 1 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	An integrated proof language for imperative programs	INFERENCE
AUTHOR NAME	Karen Zee	SVM HeaderParse 0.2
AUTHOR AFFIL	Massachusetts Institute of Technology; CSAIL, Cambridge, MA	SVM HeaderParse 0.2
AUTHOR ADDR	USA	SVM HeaderParse 0.2
AUTHOR NAME	Viktor Kuncak	SVM HeaderParse 0.2
AUTHOR AFFIL	École Polytechnique Fédérale de Lausanne	SVM HeaderParse 0.2
AUTHOR ADDR	IC, Lausanne, VD, Switzerland	SVM HeaderParse 0.2
AUTHOR NAME	Martin C. Rinard	SVM HeaderParse 0.2
AUTHOR AFFIL	Massachusetts Institute of Technology; CSAIL, Cambridge, MA	SVM HeaderParse 0.2
AUTHOR ADDR	USA ∗	SVM HeaderParse 0.2
ABSTRACT	We present an integrated proof language for guiding the actions of multiple reasoning systems as they work together to prove complex correctness properties of imperative programs. The language operates in the context of a program verification system that uses multiple reasoning systems to discharge generated proof obligations. It is designed to 1) enable developers to resolve key choice points in complex program correctness proofs, thereby enabling automated reasoning systems to successfully prove the desired correctness properties; 2) allow developers to identify key lemmas for the reasoning systems to prove, thereby guiding the reasoning systems to find an effective proof decomposition; 3) enable multiple reasoning systems to work together productively to prove a single correctness property by providing a mechanism that developers can use to divide the property into lemmas, each of which is suitable for	SVM HeaderParse 0.2
VENUE	In PLDI’09	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	338--351	INFERENCE
CITATIONS	45 found	ParsCit 1.0