Results 1 
2 of
2
ProofChecking Protocols using Bisimulations
 IN PROC. CONCUR’99, LNCS 1664
, 1999
"... 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 def ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
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.
Proving Write Invalidate Cache Coherence with Bisimulations in Isabelle/HOL
, 2000
"... The aim of this paper is to advocate the use of bisimulation relations in the verification of infinitestate or parameterized systems, and demonstrates the support that generalpurpose theorem provers can offer. A powerful proof technique, known as up to expansion, is discussed and applied in a case ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The aim of this paper is to advocate the use of bisimulation relations in the verification of infinitestate or parameterized systems, and demonstrates the support that generalpurpose theorem provers can offer. A powerful proof technique, known as up to expansion, is discussed and applied in a case study about write invalidate cache coherence. This example is of interest, as the system is parameterized in the number of its components, and the bisimulation relation reflects the coherence of the caches with the main memory.