PVS: A Prototype Verification System

PVS: A Prototype Verification System (1992)

Cached

Download Links

[www.csl.sri.com]
[www.csl.sri.com]

Other Repositories/Bibliography

DBLP

by S. Owre , J. M. Rushby , N. Shankar

Venue:	CADE
Citations:	490 - 14 self

Versions

Version History

Metadata Version 3

User correction supplied by mph

Datum	Value	Source
TITLE	PVS: A Prototype Verification System	user correction - Legacy Corrections
AUTHOR NAME	S. Owre	user correction
AUTHOR AFFIL	SRI International Computer Science Laboratory	user correction
AUTHOR ADDR	Menlo Park, CA 94025 USA	user correction
AUTHOR NAME	J. M. Rushby	user correction
AUTHOR AFFIL	SRI International Computer Science Laboratory	user correction
AUTHOR ADDR	Menlo Park, CA 94025 USA	user correction
AUTHOR NAME	N. Shankar	user correction
AUTHOR AFFIL	SRI International Computer Science Laboratory	user correction
AUTHOR ADDR	Menlo Park, CA 94025 USA	user correction
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	user correction
YEAR	1992	user correction
VENUE	CADE	user correction
CITATIONS	10 found	ParsCit 1.0