Proof-checking protocols using bisimulations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1664 LNCS, Issue , 1999, Pages 525-540

  Röckl, Christine ^a   Esparza, Javier ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BISIMULATIONS; DIRECT APPROACH; OBSERVATION EQUIVALENCE; PARAMETERIZED SYSTEM; PROOF CHECKING; THEOREM PROVERS; WEAK BISIMILARITY; WEAK BISIMULATION;

ARTIFICIAL INTELLIGENCE;

EID: 84888229570     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48320-9_36     Document Type: Conference Paper

References (20)

1. J. Baeten and W. Weijland. Process Algebra. Cambridge University Press, 1990.
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.
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.
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.
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.
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.
7. J. F. Groote and J. G. Springintveld. Algebraic verification of a distributed summation algorithm. Technical Report CS-R9640, CWI, Amsterdam, 1996.
8. T. Hardin and B. Mammass. Proving the bounded retransmission protocol in the pi-calculus. In Proc. INFINITY'98, 1998.
9. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
10. R. Milner and D. Sangiorgi. The problem of weak bisimulation up-to. In Proc. CONCUR'92, volume 630 of LNCS. Springer, 1992.
11. K. Namjoshi. A simple characterization of stuttering bisimulation. In Proc. FSTTCS'97, volume 1346 of LNCS, pages 284-296. Springer, 1997.
12. V. Natarajan and R. Cleaveland. Divergence and fair testing. In Proc. ICALP'95, volume 944 of LNCS, pages 648-659. Springer, 1995.
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.
14. K. Paliwoda and J. Sanders. The sliding-window protocol. Technical Report PRG-66, Programming Research Group, Oxford University, March 1988.
15. L. C. Paulson. Isabelle's object-logics. Technical Report 286, University of Cambridge, Computer Laboratory, 1993.
16. L. C. Paulson. Isabelle: a generic theorem prover, volume 828 of LNCS. Springer, 1994.
17. G. Plotkin. Structural operational semantics. Technical report, DAIMI, Aarhus University, 1981.
18. D. Sangiorgi. On the proof method for bisimulation. In Proc. MFCS'95, volume 969 of LNCS, pages 479-488. Springer, 1995.
19. J. L. A. Snepscheut. The sliding-window protocol revisited. Formal Aspects of Computing, 7:3-17, 1995.
20. D. Walker. Bisimulation and divergence. Information and Computation, 85(2):202-241, 1990.