DMCA
An integrated proof language for imperative programs
Cached
Download Links
| Venue: | In PLDI’09 |
| Citations: | 28 - 5 self |
BibTeX
@INPROCEEDINGS{Zee_anintegrated,
author = {Karen Zee and Viktor Kuncak and Martin C. Rinard},
title = {An integrated proof language for imperative programs},
booktitle = {In PLDI’09},
year = {},
pages = {338--351}
}
Share
 |
 |
 |
 |
||
OpenURL
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
Keyphrases
imperative program proof language key choice point enable developer complex program correctness proof effective proof decomposition generated proof obligation integrated proof language key lemma allow developer program verification system complex correctness property desired correctness property single correctness property
