Skip to main content
SpringerLink
Log in
Book cover

Formal Systems Specification pp 275–304Cite as

Using PVS for an assertional verification of the RPC-memory specification problem

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1169))

Abstract

The RPC-Memory Specification Problem has been specified and verified in an assertional method, supported by the verification system PVS. Properties of the components are expressed in the higher-order logic of PVS and all implementations have been verified by means of the interactive proof checker of PVS. A simplification of the memory specification — allowing multiple atomic reads — has been proved correct. Additionally, to increase the confidence in the specification, an implementation-oriented specification of the inner memory is shown to be equivalent to our original property-oriented formulation.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Hooman. Specification and Compositional Verification of Real-Time Systems. LNCS 558, Springer-Verlag, 1991.

    Google Scholar 

  2. J. Hooman. Correctness of real time systems by construction. In Formal Techniques in Real-Time and Fault-Tolerant Systems, pages 19–40. LNCS 863, 1994.

    Google Scholar 

  3. J. Hooman. Extending Hoare logic to real-time. Formal Aspects of Computing, 6(6A):801–825, 1994.

    Article  Google Scholar 

  4. J. Hooman. Verifying part of the ACCESS.bus protocol using PVS. In Proceedings 15th Conference on the Foundations of Software Technology and Theoretical Computer Science, pages 96–110. LNCS 1026, Springer-Verlag, 1995.

    Google Scholar 

  5. W. Janssen, M. Poel, and J. Zwiers. The compositional approach to sequential consistency and lazy caching. Memoranda informatica 94-37, University of Twente, 1994.

    Google Scholar 

  6. L. Lamport. Verification and specification of concurrent programs. In A Decade of Concurrency, pages 347–374. LNCS 803, 1994.

    Google Scholar 

  7. S. Owre, J. Rushby, and N. Shankar. PVS: A prototype verification system. In 11th Conference on Automated Deduction, volume 607 of Lecture Notes in Artificial Intelligence, pages 748–752. Springer-Verlag, 1992.

    Google Scholar 

  8. S. Owre, J. Rushby, N. Shankar, and F. von Henke. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2):107–125, 1995.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600, MB Eindhoven, The Netherlands

    Jozef Hooman

Authors
  1. Jozef Hooman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Manfred Broy Stephan Merz Katharina Spies

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hooman, J. (1996). Using PVS for an assertional verification of the RPC-memory specification problem. In: Broy, M., Merz, S., Spies, K. (eds) Formal Systems Specification. Lecture Notes in Computer Science, vol 1169. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024433

Download citation

  • DOI: https://doi.org/10.1007/BFb0024433

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61984-0

  • Online ISBN: 978-3-540-49573-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation