Skip to main content
SpringerLink
Log in
Book cover

International Conference on Theorem Proving in Higher Order Logics

TPHOLs 1996: Theorem Proving in Higher Order Logics pp 251–266Cite as

A modular coding of UNITY in COQ

  • Conference paper
  • First Online:

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

Abstract

We present a modular embedding of Unity in Coq. Special care has been put on the representation of Unity programs and on the logic used. To keep elimination of invariants and composability of safety properties, we introduce a notion of context. The definition of progress is strengthened so that we can keep progress properties when programs are composed. This is a generalization of the ad’hoc notion of “conditional progress” properties. We present fully mechanized proofs of consistency and completeness for this new system.

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. 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 Theorem Proving and its Applications, pages 1–16, Vancouver, Canada, August 1993. University of British Columbia, Springer Verlag, Lecture Notes in Computer Science, No. 780, published 1994.

    Google Scholar 

  2. Naïma Brown and Dominique Mery. A proof environment for concurrent programs. In FME'93: Industrial-Strength Formal Methods, number 670 in LNCS, pages 196–215, 1993.

    Google Scholar 

  3. Th. Coquand and G. Huet. The calculus of constructions. Information and Computation, (76):95–120, 1988.

    Google Scholar 

  4. Boutheina Chetali. Formal verification of concurrent programs: How to specify Unity using the Larch Prover. Technical Report 2475, INRIA Lorraine, 1995.

    Google Scholar 

  5. K.M. Chandy and J. Misra. Parallel Program Design. Addison-Wesley, Austin, Texas, May 1989.

    Google Scholar 

  6. Projet Coq. The Coq Proof Assistant Reference Manual. INRIA Rocquencourt and ENS Lyon, version 5.10 edition, 1994.

    Google Scholar 

  7. D.M. Goldschlag. Mechanically verifying concurrent programs with the Boyer-Moore prover. IEEE Transactions on Software Engineering, 16(9):1005–1022, September 1990.

    Article  Google Scholar 

  8. Leslie Lamport. A temporal logic of actions. Technical Report SRC-57, Digital Equipment Corporation, 1990.

    Google Scholar 

  9. Jayadev Misra. Closure properties. unpublished manuscript on a new version of Unity, electronic version available under http://www.cs.utexas.edu/users/psp/newunity.html, 1994.

    Google Scholar 

  10. Päppinghaus. On the logic of UNITY. Theoretical Computer Science, 139, 1995.

    Google Scholar 

  11. I.S.W.B. Prasetya. Mechanically Suported Design of Self-stabilizing Algorithms. PhD thesis, University of Utrecht, october 1995.

    Google Scholar 

  12. J. R. Rao. Extensions of the UNITY Methodology. Number 908 in LNCS. Springer Verlag, 1995.

    Google Scholar 

  13. Beverly Sanders. Eliminating the substitution axiom from UNITY logic. Formal Aspects of Computing, 3(2):189–205, 1991.

    Article  MathSciNet  Google Scholar 

  14. Mark G. Staskaukas. The formal specification and design of a distributed electronic funds-transfer system. IEEE Trans. on Computers, 37(12):1515–1528, December 1988.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CRIN/CNRS-INRIA Lorraine, Nancy, France

    Barbara Heyd

  2. CNET - France Telecom, Lannion, France

    Pierre Crégut

Authors
  1. Barbara Heyd
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Crégut
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gerhard Goos Juris Hartmanis Jan van Leeuwen Joakim von Wright Jim Grundy John Harrison

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heyd, B., Crégut, P. (1996). A modular coding of UNITY in COQ. In: Goos, G., Hartmanis, J., van Leeuwen, J., von Wright, J., Grundy, J., Harrison, J. (eds) Theorem Proving in Higher Order Logics. TPHOLs 1996. Lecture Notes in Computer Science, vol 1125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105409

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61587-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation