MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Proof-checking protocols using bisimulations (1999) [9 citations — 1 self]

Download:
Download as a PDF | Download as a PS
by Javier Esparza
In Proc. CONCUR’99, LNCS 1664
ftp://flop.informatik.tu-muenchen.de/pub/theory/sfb-a3/concur99.ps.gz
Add To MetaCart

Abstract:

Abstract. We report on our experience in using the Isabelle/HOL theorem prover to mechanize proofs of observation equivalence for systems with innitely many states, and for parameterized systems. We follow the direct approach: An innite relation containing the pair of systems to be shown equivalent is dened, 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. 1

Citations

2762 Communication and Concurrency – Milner - 1989
194 Process Algebra – Baeten, Weijland - 1990
154 Isabelle: A Generic Theorem Prover, volume 828 – Paulson
146 A Note on Reliable Full-Duplex Transmission over Half-Duplex Links – Bartlett, Scantlebury, et al. - 1969
46 Bisimulation and divergence – Walker - 1990
37 The origins of structural operational semantics – Plotkin - 1981
33 Divergence and fair testing – Natarajan, Cleaveland - 1995
26 Verification of an alternating bit protocol by means of process algebra – Bergstra, Klop - 1986
26 K.: I/O automata in Isabelle/HOL – Nipkow, Slind - 1995
20 Isabelle's Object-Logics – Paulson - 1993
16 A Simple Characterization of Stuttering Bisimulation – Namjoshi - 1997
14 The problem of “weak bisimulation up-to – Sangiorgi, Milner - 1992
9 Focus points and convergent process operators – Groote, Springintveld - 1995
5 On the proof method for bisimulation – Sangiorgi - 1995
2 A formal veri of the alternating bit protocol in the calculus of constructions – Bezem, Groote - 1993
2 An application of co-inductive types in Coq: Veri of the alternating bit protocol – Gimenez - 1996
2 Algebraic veri of a distributed summation algorithm – Groote, Springintveld - 1996
2 The sliding-window protocol – Paliwoda, Sanders - 1988
2 The sliding-window protocol revisited – Snepscheut - 1995
1 Proving the bounded retransmission protocol in the pi-calculus – Hardin, Mammass - 1998