See this document in CiteSeerX!

PVS: A Prototype Verification System  (Make Corrections)  
Reprint from: Deepak Kapur, editor, 11th International Conference on...



  Home/Search   Context   Related

 
View or download:
sri.com/reports/post...cade92pvs.ps.gz
sri.com/reports/post...cade92pvs.ps.gz
sri.com/reports/post...cade92pvs.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  sri.com/fmpapers (more)
From:  sri.com/fmpapers
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Introduction 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 1 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... (Update)

Active bibliography (related documents):   More   All
0.2:   Formal Verification of an Oral Messages Algorithm for Interactive .. - Rushby (1992)   (Correct)
0.1:   Formal Methods and the Certification of Critical Systems - Rushby (1993)   (Correct)
0.1:   Formal Verification for Fault-Tolerant.. - Owre, Rushby.. (1995)   (Correct)

Similar documents based on text:   More   All
0.2:   Formal Methods for Dependable Real-Time Systems - Rushby (1992)   (Correct)
0.2:   Theory Interpretations in PVS - Owre, Shankar (2001)   (Correct)
0.2:   A Tutorial on Using PVS for Hardware Verification - Owre, Rushby, Shankar, Srivas (1995)   (Correct)

BibTeX entry:   (Update)

@misc{ from-pvs,
  author = "Reprint From",
  title = "PVS: A Prototype Verification System",
  url = "citeseer.ist.psu.edu/10502.html" }
Citations (may not include all citations):
625   ACM Transactions on Programming Languages and Systems (context) - Lamport, Shostak et al. - 1982
392   A Computational Logic (context) - Boyer, Moore - 1979
150   Edinburgh LCF: A Mechanized Logic of Computation (context) - Gordon, Milner et al. - 1979
121   Deciding combinations of theories (context) - Shostak - 1984
29   Formal Techniques in Real-Time and Fault-Tolerant Systems (context) - Vytopil - 1992
24   Mechanical verification of a generalized protocol for Byzant.. - Shankar
23   Using transformations and verification in circuit design (context) - Saxe, Garland et al. - 1991
21   MJRTY---a fast majority vote algorithm - Boyer, Moore - 1991
15   Formal specification and verification of a fault-masking and.. - Rushby

Documents on the same site (http://www.csl.sri.com/fm-papers.html):   More
Proof Search in the Intuitionistic Sequent Calculus - Shankar (1991)   (Correct)
[12] Sam Owre, John Rushby, Natarajan Shankar, and.. - Fme Industrial-Strength   (Correct)
Mechanical Verification of a Generalized Protocol for Byzantine.. - Shankar (1992)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC