DMCA
PVS: A Prototype Verification System (1992)
| Venue: | CADE |
| Citations: | 652 - 16 self |
BibTeX
@MISC{Owre92pvs:a,
author = {S. Owre and J. M. Rushby and N. Shankar},
title = {PVS: A Prototype Verification System},
year = {1992}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
PVS is a prototype system for writing specifications and constructing proofs. Its development has been shaped by our experiences studying or using several other systems and performing a number of rather substantial formal verifications (e.g., [5,6,8]). PVS is fully implemented and freely available. It has been used to construct proofs of nontrivial difficulty with relatively modest amounts of human effort. Here, we describe some of the motivation behind PVS and provide some details of the system. Automated reasoning systems typically fall in one of two classes: those that provide powerful automation for an impoverished logic, and others that feature expressive logics but only limited automation. PVS attempts to tread the middle ground between these two classes by providing mechanical assistance to support clear and abstract specifications, and readable yet sound proofs for difficult theorems. Our goal is to provide mechanically-checked specificati
Keyphrases
prototype verification system sound proof limited automation human effort modest amount difficult theorem prototype system mechanically-checked specificati mechanical assistance impoverished logic feature expressive logic several system substantial formal verification powerful automation abstract specification middle ground nontrivial difficulty
