Prototype Verification System
From Wikipedia, the free encyclopedia
PVS, or the Prototype Verification System, is a specification language integrated with support tools and a theorem prover.
It was developed at the Computer Science Laboratory of SRI International, California, USA. PVS is based on a kernel consisting of an extension of Church's theory of types with dependent types, and is fundamentally a classical typed higher-order logic. The base types include uninterpreted types that may be introduced by the user, and built-in types such as the booleans, integers, reals, and the ordinals. Type-constructors include functions, sets, tuples, records, enumerations, and abstract data types. Predicate subtypes and dependent types can be used to introduce constraints; these constrained types may incur proof obligations (called type-correctness conditions or TCCs) during typechecking. PVS specifications are organized into parameterized theories.
The system is implemented in Common Lisp, and is released under the GNU General Public License (GPL).
[edit] References
- Owre, Shankar, and Rushby, 1992. PVS: A Prototype Verification System. Published in the CADE 11 conference proceedings.
[edit] See also
[edit] External links
- PVS website at the Computer Science Laboratory, SRI.
- Summary of PVS by John Rushby at the Mechanized Reasoning database of Michael Kohlhase and Carolyn Talcott [1].
 |
This logic-related article is a stub. You can help by expanding it. |
