Verification of an alternating bit protocol by means of process algebra
Proceedings of the International Spring School on Mathematical method of specification and synthesis of software systems '85
Information and Computation
Process algebra
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
Communication and Concurrency
On the Proof Method for Bisimulation (Extended Abstract)
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
An Application of Co-inductive Types in Coq: Verification of the Alternating Bit Protocol
TYPES '95 Selected papers from the International Workshop on Types for Proofs and Programs
The Problem of ``Weak Bisimulation up to''
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
A Simple Characterization of Stuttering Bisimulation
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
Focus Points and Convergent Process Operators
Focus Points and Convergent Process Operators
Algebraic verification of a distributed summation algorithm
Algebraic verification of a distributed summation algorithm
| Hi-index | 0.00 |
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.