DMCA
PVS: Combining Specification, Proof Checking, and Model Checking (1996)
| Citations: | 229 - 5 self |
BibTeX
@INPROCEEDINGS{Owre96pvs:combining,
author = {S. Owre and S. Rajan and J. M. Rushby and N. Shankar and M. Srivas},
title = {PVS: Combining Specification, Proof Checking, and Model Checking},
booktitle = {},
year = {1996},
pages = {411--414},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
rem Proving and Typechecking The PVS specification language is based on classical, simply typed higher-order logic, but the type system has been augmented with subtypes and dependent types. Though typechecking is undecidable for the PVS type system, the PVS typechecker automatically checks for simple type correctness and generates proof obligations corresponding to predicate subtypes. These proof obligations can be discharged through the use of the PVS proof checker. PVS also has parametric theories so that it is possible to capture, say, the notion of sorting with respect to arbitrary sizes, types, and ordering relations. By exploiting subtyping, dependent typing, and parametric theories, researchers at NASA Langley Research Center and SRI have developed a very general bit-vector library. Paul Miner at NASA ? The development of PVS was funded by SRI International through IR&D funds. Various applications and customizations have been funded by NSF Grant CCR9300
Keyphrases
model checking combining specification proof checking parametric theory dependent type dependent typing ir fund sri international nasa langley research center higher-order logic pvs typechecker simple type correctness pvs type system proof obligation rem proving arbitrary size paul miner general bit-vector library various application nsf grant ccr9300 pvs proof checker pvs specification language type system
