Results 1 
5 of
5
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.
eRENA3.1] Demonstration and Evaluation of Inhabited Television, eRENA Deliverable 3.1
 Proceedings of the 6th Workshop on RealTime Systems (ARTS’04
, 1998
"... Abstract. The cones and foci verification method from Groote and Springintveld [9] was extended to timed systems by van der Zwaag [17]. We present an extension of this cones and foci method for timed systems, which can cope with infinite τsequences. We prove soundness of our approach and give small ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. The cones and foci verification method from Groote and Springintveld [9] was extended to timed systems by van der Zwaag [17]. We present an extension of this cones and foci method for timed systems, which can cope with infinite τsequences. We prove soundness of our approach and give small verification examples. 1
Designing and understanding the behaviour of systems
, 2007
"... Robin Milner observed in 1973 that the primary task of computers appeared to be interacting with their environment, yet the theory of programs and programming at that time seemed to ignore this fact completely [36, 37]. As a consequence, he set out working on his seminal book [38, 40] in which he de ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Robin Milner observed in 1973 that the primary task of computers appeared to be interacting with their environment, yet the theory of programs and programming at that time seemed to ignore this fact completely [36, 37]. As a consequence, he set out working on his seminal book [38, 40] in which he developed the CCS, the Calculus of Communicating Systems. At the same time two other main process algebras were developed, namely ACP (Algebra of Communicating Processes, [5]) and CSP (Communicating Sequential Processes, [27, 28]). Interesting as they were, these process algebras were too bare to be used for the description of actual systems, mainly because they lacked a proper integration of data. In order to solve this, process algebraic specification languages have been designed (most notably LOTOS [29] and PSF [35]) which contained both data and processes. A problem with these languages was that they were too complex to act as a basic carrier for the development of behavioural analysis techniques. We designed an intermediate language, namely mCRL2 (and its direct predecessor µCRL [21, 19]) as a stripped down process specification language or an extended process algebra. It contains exactly those ingredients needed for a complete behavioural specification, and its (relative) simplicity allows to concentrate on proof and analysis techniques for process behaviour. Throughout the years many of these techniques have been developed. To mention a few: the
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
Verification of Mobile Ad Hoc Networks: An Algebraic Approach
"... We introduced Computed Network Process Theory to reason about protocols for mobile ad hoc networks (MANETs). Here we explore the applicability of our framework in two regards: model checking and equational reasoning. The operational semantics of our framework is based on constrained labeled transiti ..."
Abstract
 Add to MetaCart
We introduced Computed Network Process Theory to reason about protocols for mobile ad hoc networks (MANETs). Here we explore the applicability of our framework in two regards: model checking and equational reasoning. The operational semantics of our framework is based on constrained labeled transition systems (CLTSs), in which each transition label is parameterized with the set of topologies for which this transition is enabled. We illustrate how through model checking on CLTSs one can analyse mobility scenarios of MANET protocols. Furthermore, we show how by equational theory one can reason about MANETs consisting of a finite but unbounded set of nodes, in which all nodes deploy the same protocol. Model checking and equational reasoning together provide us with an appropriate framework to prove the correctness of MANETs. We demonstrate the applicability of our framework by a case study on a simple routing protocol.