Results 1  10
of
12
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 Veri cation of a Sliding Window
"... Abstract. We prove the correctness of a sliding window protocol with an arbitrary nite 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 a ..."
Abstract
 Add to MetaCart
Abstract. We prove the correctness of a sliding window protocol with an arbitrary nite 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.
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.
Analysis and Verification of Systems with Dynamically Evolving Structure
"... This thesis is concerned with verification and analysis techniques for software systems characterized by dynamically evolving structure, such as dynamic creation and deletion of objects, mobility and variable topology. Examples for such systems are pointer structures, objectbased systems and commun ..."
Abstract
 Add to MetaCart
This thesis is concerned with verification and analysis techniques for software systems characterized by dynamically evolving structure, such as dynamic creation and deletion of objects, mobility and variable topology. Examples for such systems are pointer structures, objectbased systems and communication protocols in which the number of participants is not constant. The approach taken here is based on graph transformation systems, an intuitive and—at the same time—powerful formalism for the modelling of distributed and mobile systems. So far there exists comparatively little research concerning the verification of graph rewriting. We will—in the first part of this thesis—introduce graph transformations and give an overview of existing analysis and verification methods, with a focus on the verification of systems with dynamically evolving structure. Then we will describe three original lines of research: behavioural equivalences, type systems and approximation by Petri nets, all of them concerned with the analysis of