Results 1 
6 of
6
Mobile processes: A commented bibliography
 of Lecture Notes in Computer Science
, 2000
"... Abstract. We propose a short bibliographic survey of calculi for mobile processes. Contrasting with other similar exercises, we consider two related, but distinct, notions of mobile processes, namely labile processes, which can exhibit dynamic changes in their interaction structure, as modelled in t ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. We propose a short bibliographic survey of calculi for mobile processes. Contrasting with other similar exercises, we consider two related, but distinct, notions of mobile processes, namely labile processes, which can exhibit dynamic changes in their interaction structure, as modelled in the πcalculus of Milner, Parrow and Walker for example, and motile processes, which can exhibit motion, as modelled in the ambient calculus of Cardelli and Gordon. A common characteristic of the algebraic frameworks presented in this paper is the use of names as first class values and the support for the dynamic generation of new, fresh names. 1
Proving Write Invalidate Cache Coherence with Bisimulations in Isabelle/HOL
"... . The aim of this paper is to advocate the use of bisimulation relations in the verication of innitestate or parameterized systems, and demonstrates the support that generalpurpose theorem provers can oer. A powerful proof technique, known as up to expansion, is discussed and applied in a case stu ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
. The aim of this paper is to advocate the use of bisimulation relations in the verication of innitestate or parameterized systems, and demonstrates the support that generalpurpose theorem provers can oer. 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 reects the coherence of the caches with the main memory. 1 Introduction In recent years, generalpurpose theorem proving has come to play an important role in the verication of concurrent systems, especially for systems which are too large to be treated fully automatically, or even innite. Yet, if one is not to use the tool as a mere proof checker, some attention has to be spent on the choice of a suitable methodology. (1) Although generalpurpose theorem provers like Isabelle, PVS, or Coq, oer a considerable amount of au...
Cones and foci: A mechanical framework for protocol verification
"... Abstract 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 g ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract 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 satises its specication. We report on our experience in the mechanization of observation equivalence proofs with the help of a generalpurpose theorem prover. Several casestudies are considered, incluiding an ..."
Abstract
 Add to MetaCart
Observation equivalence is a wellknown technique for proving that a concurrent system satises its specication. We report on our experience in the mechanization of observation equivalence proofs with the help of a generalpurpose theorem prover. Several casestudies are considered, incluiding an sliding window and a cachecoherence protocol. In all cases the system has an innite 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. 1 Introduction One of the main goals of the A3 Teilprojekt within the Sonderforschungsbereich 342 is the development of verication techniques for distributed systems. Since 1995, special emphasis has been put on automatic (modelchecking) and semiautomatic techniques, and in the period 19982000, A3 has devoted special attention and resources to the development of machine support for the analysis of systems ...
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.
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
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