Skip to main content

On the Verification of VDM Specification and Refinement with PVS

  • Chapter

Summary

This chapter describes using the PVS system as a tool to support VDMSL. It is possible to translate from VDM-SL into the PVS specification language in a very easy and direct manner, thus enabling the use of PVS for typechecking and verifying properties of VDM-SL specifications and refinements. The translation is described in detail and illustrated with examples. The drawbacks of the translation are that it must be done manually (though automation may be possible), and that the “shallow embedding” technique which is used does not accurately capture the proof rules of VDM-SL. The benefits come from the facts that the portion of VDM-SL which can be represented is substantial and that it is a great advantage to be able to use the powerful PVS proof-checker. A variety of examples of verifications using PVS are described in the chapter.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. S. Agerholm. A HOL Basis for Reasoning about Functional Programs PhD thesis, BRICS, Department of Computer Science, University of Aarhus, 1994. Available as Technical Report RS-94–44.

    Google Scholar 

  2. S. Agerholm. LCF examples in HOL. In The Computer Journal, 38(2), 1995.

    Google Scholar 

  3. S. Agerholm. Translating Specifications in VDM-SL to PVS. In Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics (TPHOL ’86), Springer-Verlag LNCS 1125, 1996.

    Google Scholar 

  4. S. Agerholm and J. Frost. An Isabelle-based Theorem Prover for VDM-SL. In Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics (TPHOLs’97), Springer-Verlag LNCS, 1997.

    Google Scholar 

  5. S. Agerholm and J. Frost. Towards an Integrated CASE and Theorem Proving Tool for VDM-SL. In FME’97, Springer-Verlag LNCS, 1997.

    Google Scholar 

  6. B. Aichernig and P. G. Larsen. A Proof Obligation Generator for VDM-SL. In FME’97, Springer-Verlag LNCS, 1997.

    Google Scholar 

  7. D.J. Andrews and M. Bruun et al. Information Technology — Programming Languages, their environments and system software interfaces — Vienna Development Method-Specification Language Part 1: Base language. ISO Draft International Standard: 13817–1, 1995.

    Google Scholar 

  8. J.C. Bicarregui. A Model-Oriented Analysis of a Communications Protocol. Technical report RAL-93–099, Rutherford Appleton Laboratory, 1993.

    Google Scholar 

  9. J.C. Bicarregui and B. Ritchie. Invariants, Frames and Postconditions: a comparison of the VDM and B notations. In Proceeding of Formal Methods Europe ’83, Springer-Verlag LNCS 670, 1993. Also in IEEE Transaction on Software Engineering, 21(2), 1995.

    Google Scholar 

  10. R. J. Boulton and A. D. Gordon et al Experience with Embedding Hardware Description Languages in HOL. In Theorem Provers in Circuit Design: Theory, Practice and Experience: Proceedings of the IFIP TC10/WG 10.2 International Conference, North-Holland, IFIP Transactions A-10, 1992.

    Google Scholar 

  11. G. Bruns and S. Anderson. The Formalization and Analysis of a Communications Protocol. In Formal Aspects of Computing, 6(1), Springer, 1994.

    Google Scholar 

  12. G. Collins and D. Syme. A theory of finite maps. In Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and its Applications, Springer-Verlag LNCS 971, September 1995.

    Google Scholar 

  13. J. Crow, S. Owre et al A Tutorial Introduction to PVS. Computer Science Laboratory, SRI International, Menlo Park, CA, February 1993.

    Google Scholar 

  14. R. Elmstrom, P.G. Larsen, and P.B. Lassen. The IFAD VDM-SL Toolbox: A practical approach to formal specifications. In ACM Sigplan Notices 29(9), 1994

    Google Scholar 

  15. P.G. Larsen. Towards Proof Rules for VDM-SL PhD thesis, Technical University of Denmark, Department of Computer Science, March 1995. ID-TR:1995160.

    Google Scholar 

  16. Peter G. Larsen and Bo S. Hansen. Semantics of Underdetermined Expressions. In Formal Aspects of Computing, 8(1), 1996.

    Google Scholar 

  17. L.L. Santoline et al. Multiprocessor Shared-Memory Information Exchange. In IEEE Transactions on Nuclear Science, 36(1), 1989.

    Google Scholar 

  18. H. Sondergaard and P. Sestoft. Non-determinism in functional languages. In The Computer Journal, 35(5), 1992.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag London Limited

About this chapter

Cite this chapter

Agerholm, S., Bicarregui, J., Maharaj, S. (1998). On the Verification of VDM Specification and Refinement with PVS. In: Bicarregui, J.C. (eds) Proof in VDM: Case Studies. Formal Approaches to Computing and Information Technology (FACIT). Springer, London. https://doi.org/10.1007/978-1-4471-1532-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-1532-8_6

  • Publisher Name: Springer, London

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

  • Online ISBN: 978-1-4471-1532-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics