Results 1  10
of
11
Mobile Processes: a Commented Bibliography, Proc. Modelling and Verification of Parallel Processes
 Eds.), Lecture Notes in Computer Science
"... ..."
(Show Context)
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.
Cones and foci: A mechanical framework for protocol verification
, 2006
"... We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between data objects. Compared to the original cones and foci method from Groote and Springintveld, our method is more generall ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between data objects. Compared to the original cones and foci method from Groote and Springintveld, our method is more generally applicable, because it does not require a preprocessing step to eliminate τloops. We prove soundness of our approach and present a set of rules to prove the reachability of focus points. Our method has been formalized and proved correct using PVS. Thus we have established a framework for mechanical protocol verification. We apply this framework to the Concurrent Alternating Bit Protocol.
On the Mechanized Verification of Infinite Systems
"... Observation equivalence is a wellknown technique for proving that a concurrent system satisfies its specification. We report on our experience in the mechanization of observation equivalence proofs with the help of a generalpurpose theorem prover. Several casestudies are considered, including a ..."
Abstract
 Add to MetaCart
Observation equivalence is a wellknown technique for proving that a concurrent system satisfies its specification. We report on our experience in the mechanization of observation equivalence proofs with the help of a generalpurpose theorem prover. Several casestudies are considered, including a sliding window and a cachecoherence protocol. In all cases the system has an infinite number of states, and sometimes also an arbitrarily large number of components. We show how compositionality and bisimulationupto techniques can be applied to reduce the size of the proofs.
CWI, Embedded Systems Group
"... Abstract. We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. We show that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory, and was c ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. We show that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory, and was checked with the help of PVS. 1
Mechanical Verification of a TwoWay Sliding Window Protocol
"... Science Abstract. We prove the correctness of a twoway sliding window protocol with piggybacking, where the acknowledgments of the latest received data are attached to the next data transmitted back into the channel. The window size of both parties are considered ..."
Abstract
 Add to MetaCart
(Show Context)
Science Abstract. We prove the correctness of a twoway sliding window protocol with piggybacking, where the acknowledgments of the latest received data are attached to the next data transmitted back into the channel. The window size of both parties are considered
Verifying a Sliding Window Protocol in μCRL
, 2003
"... We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. The correctness consists of showing that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic ..."
Abstract
 Add to MetaCart
We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. The correctness consists of showing that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory.
Under consideration for publication in Formal Aspects of Computing Verification of a Sliding Window Protocol in µCRL and PVS
"... Abstract. We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. The correctness consists of showing that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an ..."
Abstract
 Add to MetaCart
Abstract. We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. The correctness consists of showing that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory, and has been checked in the theorem prover PVS.
The Concurrency Column
"... in organizing a thematic research workshop, a strategic meeting charting new research agenda or an advanced school on a theme related to concurrency theory to consider the University Residential Centre of Bertinoro, Bertinoro (Forl), Italy, as a possible location for it. Activities taking place in ..."
Abstract
 Add to MetaCart
(Show Context)
in organizing a thematic research workshop, a strategic meeting charting new research agenda or an advanced school on a theme related to concurrency theory to consider the University Residential Centre of Bertinoro, Bertinoro (Forl), Italy, as a possible location for it. Activities taking place in that beautiful conference location are held under the organization and sponsorship of BICI (Bertinoro International Center for Informatics). On behalf of the concurrency theory community, I welcome the establishment of such an association devoted to the development of research in Computer Science via the sponsorship of high quality events in an environment that offers excellent support, and a congenial atmosphere, for the hosting of research activities. P###### ####### ##### ##### ########### Wan Fokkink, Jan Friso Groote, Michel Reniers Dep. of Mathematics and Computer Science, Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands CWI, P.O. Box 94079, 109
1 CWI, Specification and Analysis of Embedded Systems Group
"... We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between data objects. Compared to the original cones and foci method from Groote and Springintveld, our method is more generally ..."
Abstract
 Add to MetaCart
(Show Context)
We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between data objects. Compared to the original cones and foci method from Groote and Springintveld, our method is more generally applicable, because it does not require a preprocessing step to eliminate τloops. We prove soundness of our approach and present a set of rules to prove the reachability of focus points. Our method has been formalized and proved correct using PVS. Thus we have established a framework for mechanical protocol verification. We apply this framework to the Concurrent Alternating Bit Protocol.