Skip to main content

A Structural Embedding of Ocsid in PVS

  • Conference paper
  • First Online:

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

Abstract

We describe a structural embedding of the Ocsid specification language into the logic of the PVS theorem prover. A front end tool is used to manipulate the structural elements of the language, while the expression language is directly borrowed from the theorem prover.

The structural embedding allows us to express and verify invariant properties of distributed systems in an abstract form. An invariant can be verified once, and reused multiple times by discharging a set of relatively simple proof obligations.

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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.

References

  1. Timo Aaltonen, Mika Katara, and Risto Pitkänen. DisCo toolset-the new generation. Journal of Universal Computer Science, 7(1):3–18, 2001. http://www.jucs.org.

    MATH  Google Scholar 

  2. Jean-Raymond Abrial. The B Book-Assigning Programs to Meanings. Cambridge University Press, August 1996.

    Google Scholar 

  3. S. Agerholm and J. Frost. An isabelle-based theorem prover for VDM-SL. In Proc. 10th International Theorem Proving in Higher Order Logics Conference, pages 1–16, 1997.

    Google Scholar 

  4. Sten Agerholm, Juan Bicarregui, and Savi Maharaj. On the verification of VDM specification and refinement with PVS. In Juan Bicarregui, editor, Proof in VDM: Case Studies, FACIT (Formal Approaches to Computing and Information Technology), chapter 6, pages 157–190. Springer-Verlag, London, UK, 1997.

    Google Scholar 

  5. F. Andersen, K. D. Petersen, and J. S. Petterson. Program verification using HOL-UNITY. In J. J. Joyce and C.-J.H Seger, editors, International Workshop on Higher Order Logic and its Applications, volume 780 of Lecture Notes in Computer Science, pages 1–16, 1994.

    Google Scholar 

  6. R. J. R. Back and R. Kurki-Suonio. Distributed cooperation with action systems. ACM Transactions on Programming Languages and Systems, 10(4):513–554, October 1988.

    Google Scholar 

  7. R. J. R. Back and R. Kurki-Suonio. Decentralization of process nets with a centralized control. Distributed Computing, (3):73–87, 1989.

    Article  Google Scholar 

  8. J. Bowen and M. J. C. Gordon. Z and HOL. In J. Bowen and A. Hall, editors, Z User Workshop, Workshops in Computing, pages 141–167. Springer-Verlag, Cambridge, 1994.

    Google Scholar 

  9. K. M. Chandy and L. Lamport. Distributed snapshots: determining the global state of distributed systems. ACM Transactions on Computer Systems, 3(1):63–75, 1985.

    Article  Google Scholar 

  10. K. M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.

    Google Scholar 

  11. K. Mani Chandy, Jayadev Misra, and Laura M. Haas. Distributed deadlock detection. ACM Transactions on Computer Systems, 1(2):144–156, May 1983.

    Google Scholar 

  12. John Dawes. The VDM-SL Reference Guide. Pitman, 1991. ISBN 0-273-03151-1.

    Google Scholar 

  13. Edsger W. Dijkstra and C. S. Scholten. Termination detection for diffusing computations. Information Processing Letters, 11(1):1–4, August 1980.

    Google Scholar 

  14. Michael J. C. Gordon. HOL: A proof generating system for higher-order logic. In Graham Birtwistle and P. A. Subrahmanyam, editors, VLSI Specification, Verification and Synthesis, pages 73–128. Boston Kluwer Academic Publishers, 1988.

    Google Scholar 

  15. David Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8(3):231–274, June 1987.

    Google Scholar 

  16. Barbara Heyd and Pierre Crégut. A modular coding of UNITY in COQ. In J. von Wright, T. Grundy, and J. Harrison, editors, Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics, volume 1125 of Lecture Notes in Computer Science, pages 251–266, 1996.

    Google Scholar 

  17. Nayeem Islam and Murthy Devarakonda. An essential design pattern for faulttolerant distributed state sharing. Communications of the ACM (CACM), 39(10):65–74, October 1996.

    Google Scholar 

  18. H.-M. Järvinen, R. Kurki-Suonio, M. Sakkinen, and K. Systä. Object-oriented specification of reactive systems. In Proceedings of the 12th International Conference on Software Engineering, pages 63–71. IEEE Computer Society Press, 1990.

    Google Scholar 

  19. Pertti Kellomäki. Mechanical Verification of Invariant Properties of DisCo Specifications. PhD thesis, Tampere University of Technology, 1997.

    Google Scholar 

  20. Pertti Kellomäki. Verification of reactive systems using DisCo and PVS. In John Fitzgerald, Cliff B. Jones, and Peter Lucas, editors, FME’97: Industrial Applications and Strengthened Foundations of Formal Methods, number 1313 in Lecture Notes in Computer Science, pages 589–604. Springer-Verlag, 1997.

    Google Scholar 

  21. Reino Kurki-Suonio. Fundamentals of object-oriented specification and modeling of collective behaviors. In H. Kilov and W. Harvey, editors, Object-Oriented Behavioral Specifications, pages 101–120. Kluwer Academic Publishers, 1996.

    Google Scholar 

  22. Leslie Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872–923, May 1994.

    Google Scholar 

  23. Thomas Långbacka. A HOL formalization of the temporal logic of actions. In T. F. Melham and J. Camilleri, editors, Higher Order Logic Theorem Proving and Its Applications, volume 859 of Lecture Notes in Computer Science, Valetta, Malta, 1994. Springer Verlag.

    Google Scholar 

  24. César Muñoz. PBS: Support for the B-method in PVS. Technical Report SRICSL-99-1, Computer Science Laboratory, SRI International, Menlo Park, CA, February 1999.

    Google Scholar 

  25. César Muñoz and John Rushby. Structural embeddings: Mechanization with method. In Jeannette Wing and Jim Woodcock, editors, FM99: The World Congress in Formal Methods, volume 1708 of Lecture Notes in Computer Science, pages 452–471, Toulouse, France, September 1999. Springer-Verlag.

    Google Scholar 

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

    Google Scholar 

  27. Sam Owre, John Rushby, and N. Shankar. Integration in PVS: Tables, types, and model checking. In Ed Brinksma, editor, Tools and Algorithms for the Construction and Analysis of Systems TACAS’ 97, number 1217 in Lecture Notes in Computer Science, pages 366–383, Enschede, The Netherlands, April 1997. Springer-Verlag.

    Chapter  Google Scholar 

  28. Paulson. Mechanizing UNITY in isabelle. ACM Transactions on Computational Logic, 1(1), 2000.

    Google Scholar 

  29. S. Kalvala. A Formulation of TLA in Isabelle. In E.T. Schubert, P.J. Windley, and J. Alves-Foss, editors, 8th International Workshop on Higher Order Logic Theorem Proving and its Applications, volume 971 of Lecture Notes in Computer Science, pages 214–228, Aspen Grove, Utah, USA, September 1995. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kellomäki, P. (2001). A Structural Embedding of Ocsid in PVS. In: Boulton, R.J., Jackson, P.B. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2001. Lecture Notes in Computer Science, vol 2152. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44755-5_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-44755-5_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44755-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics