Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 1999: CONCUR’99 Concurrency Theory pp 525–540Cite as

Proof-Checking Protocols Using Bisimulations

  • Conference paper
  • First Online:

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

Abstract

We report on our experience in using the Isabelle/HOL theorem prover to mechanize proofs of observation equivalence for systems with infinitely many states, and for parameterized systems. We follow the direct approach: An infinite relation containing the pair of systems to be shown equivalent is defined, and then proved to be a weak bisimulation. The weak bisimilarity proof is split into many cases, corresponding to the derivatives of the pairs in the relation. Isabelle/HOL automatically proves simple cases, and guarantees that no case is forgotten. The strengths and weaknesses of the approach are discussed.

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

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.

References

  1. J. Baeten and W. Weijland. Process Algebra. Cambridge University Press, 1990.

    Google Scholar 

  2. K. A. Bartlett, R. A. Scantlebury, and P. T. Wilkinson. A note on reliable fullduplex transmission over half-duplex links. Comm. of the ACM, 12(5):260–261, May 1969.

    Article  Google Scholar 

  3. J. A. Bergstra and J. W. Klop. Verification of an alternating bit protocol by means of process algebra. In Mathematical Methods of Specification and Synthesis of Software Systems’ 85, volume 215 of LNCS. Springer, 1985.

    Google Scholar 

  4. M. Bezem and J. F. Groote. A formal verification of the alternating bit protocol in the calculus of constructions. Logic Group Preprint Series 88, Dept. of Philosophy, Utrecht University, 1993.

    Google Scholar 

  5. E. Gimenez. An application of co-inductive types in Coq: Verification of the alternating bit protocol. In Proc. TYPES’95, volume 1158 of LNCS, pages 135–152. Springer, 1996.

    Google Scholar 

  6. J. F. Groote and J. G. Springintveld. Focus points and convergent process operators. Logic Group Preprint Series 142, Dept. of Philosophy, Utrecht University, 1995.

    Google Scholar 

  7. J. F. Groote and J. G. Springintveld. Algebraic verification of a distributed summation algorithm. Technical Report CS-R9640, CWI, Amsterdam, 1996.

    Google Scholar 

  8. T. Hardin and B. Mammass. Proving the bounded retransmission protocol in the pi-calculus. In Proc. INFINITY’98, 1998.

    Google Scholar 

  9. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.

    Google Scholar 

  10. R. Milner and D. Sangiorgi. The problem of weak bisimulation up-to. In Proc. CONCUR’92, volume 630 of LNCS. Springer, 1992.

    Google Scholar 

  11. K. Namjoshi. A simple characterization of stuttering bisimulation. In Proc. FSTTCS’97, volume 1346 of LNCS, pages 284–296. Springer, 1997.

    Google Scholar 

  12. V. Natarajan and R. Cleaveland. Divergence and fair testing. In Proc. ICALP’95, volume 944 of LNCS, pages 648–659. Springer, 1995.

    Google Scholar 

  13. T. Nipkow and K. Slind. I/O automata in Isabelle/HOL. In Proc. TYPES’94, volume 996 of LNCS, pages 101–119. Springer, 1994.

    Google Scholar 

  14. K. Paliwoda and J. Sanders. The sliding-window protocol. Technical Report PRG66, Programming Research Group, Oxford University, March 1988.

    Google Scholar 

  15. L. C. Paulson. Isabelle’s object-logics. Technical Report 286, University of Cambridge, Computer Laboratory, 1993.

    Google Scholar 

  16. L. C. Paulson. Isabelle: a generic theorem prover, volume 828 of LNCS. Springer, 1994.

    MATH  Google Scholar 

  17. G. Plotkin. Structural operational semantics. Technical report, DAIMI, Aarhus University, 1981.

    Google Scholar 

  18. D. Sangiorgi. On the proof method for bisimulation. In Proc. MFCS’95, volume 969 of LNCS, pages 479–488. Springer, 1995.

    Google Scholar 

  19. J. L. A. Snepscheut. The sliding-window protocol revisited. Formal Aspects of Computing, 7:3–17, 1995.

    Article  MATH  Google Scholar 

  20. D. Walker. Bisimulation and divergence. Information and Computation, 85(2):202241, 1990.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität München, Fakultät für Informatik, D-80290, München

    Christine Röckl & Javier Esparza

Authors
  1. Christine Röckl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Javier Esparza
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

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

    Jos C. M. Baeten  & Sjouke Mauw  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Röckl, C., Esparza, J. (1999). Proof-Checking Protocols Using Bisimulations. In: Baeten, J.C.M., Mauw, S. (eds) CONCUR’99 Concurrency Theory. CONCUR 1999. Lecture Notes in Computer Science, vol 1664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48320-9_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-48320-9_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48320-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation