Skip to main content
SpringerLink
Log in

PVS: A prototype verification system

  • Conference paper
  • First Online:
Automated Deduction—CADE-11 (CADE 1992)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 607))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. S. Boyer and J S. Moore. A Computational Logic. Academic Press, New York, 1979.

    Google Scholar 

  2. R. S. Boyer and J S. Moore. MJRTY—a fast majority vote algorithm. In Robert S. Boyer, editor, Automated Reasoning: Essays in Honor of Woody Bledsoe, volume 1 of Automated Reasoning Series, pages 105–117. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1991.

    Google Scholar 

  3. M. Gordon, R. Milner, and C. Wadsworth. Edinburgh LCF: A Mechanized Logic of Compulation, volume 78 of Lecture Notes in Computer Science. Springer Verlag, 1979.

    Google Scholar 

  4. L. Lamport, R. E. Shostak, and M. Pease. The Byzantine generals problem. ACM TOPLAS, 4(3):382–401, July 1982.

    Google Scholar 

  5. J. M. Rushby. Formal specification and verification of a fault-masking and transientrecovery model for digital flight-control systems. In Vytopil [10], pages 237–257.

    Google Scholar 

  6. J. M. Rushby and F. W. von Henke. Formal verification of algorithms for critical systems. In SIGSOFT '91: Software for Critical Systems, New Orleans, LA, December 1991. Published as ACM SIGSOFT Engineering Notes, 16(5):1–15.

    Google Scholar 

  7. J. B. Saxe, S. J. Garland, J. V. Guttag, and J. J. Horning. Using transformations and verification in circuit design. Technical Report 78, DEC Systems Research Center, Palo Alto, CA, September 1991.

    Google Scholar 

  8. N. Shankar. Mechanical verification of a generalized protocol for Byzantine fault-tolerant clock synchronization. In Vytopil [10]., pages 217–236.

    Google Scholar 

  9. R. E. Shostak. Deciding combinations of theories. Journal of the ACM, 31(1):1–12, 1984.

    Google Scholar 

  10. J. Vytopil, editor. Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 571 of Lecture Notes in Computer Science, Nijmegen, The Netherlands, January 1992. Springer Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SRI International Computer Science Laboratory, 94025, Menlo Park, CA, USA

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

Authors
  1. S. Owre
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. M. Rushby
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. Shankar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Deepak Kapur

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Owre, S., Rushby, J.M., Shankar, N. (1992). PVS: A prototype verification system. In: Kapur, D. (eds) Automated Deduction—CADE-11. CADE 1992. Lecture Notes in Computer Science, vol 607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55602-8_217

Download citation

  • DOI: https://doi.org/10.1007/3-540-55602-8_217

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55602-2

  • Online ISBN: 978-3-540-47252-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation