Results 1 
5 of
5
Focus points and convergent process operators: A proof strategy for protocol verification
, 1995
"... We present a strategy for finding algebraic correctness proofs for communication systems. It is described in the setting of µCRL [11], which is, roughly, ACP [2, 3] extended with a formal treatment of the interaction between data and processes. The strategy has already been applied successfully in [ ..."
Abstract

Cited by 43 (12 self)
 Add to MetaCart
We present a strategy for finding algebraic correctness proofs for communication systems. It is described in the setting of µCRL [11], which is, roughly, ACP [2, 3] extended with a formal treatment of the interaction between data and processes. The strategy has already been applied successfully in [4] and [10], but was not explicitly identified as such. Moreover, the protocols that were verified in these papers were rather complex, so that the general picture was obscured by the amount of details. In this paper, the proof strategy is materialised in the form of definitions and theorems. These results reduce a large part of protocol verification to a number of trivial facts concerning data parameters occurring in implementation and specification. This greatly simplifies protocol verifications and makes our approach amenable to mechanical assistance � experiments in this direction seem promising. The strategy is illustrated by several small examples and one larger example, the Concurrent Alternating Bit Protocol (CABP). Although simple, this protocol contains a large amount of internal parallelism, so that all relevant issues make their appearance.
Process algebra with timing: real time and discrete time
 Smolka (Eds.), Handbook of Process Algebra
, 2001
"... We present real time and discrete time versions of ACP with absolute timing and relative timing. The startingpoint isanewrealtimeversion with absolute timing, called ACPsat, featuring urgent actions and a delay operator. The discrete time versions are conservative extensions of the discrete time ve ..."
Abstract

Cited by 33 (11 self)
 Add to MetaCart
We present real time and discrete time versions of ACP with absolute timing and relative timing. The startingpoint isanewrealtimeversion with absolute timing, called ACPsat, featuring urgent actions and a delay operator. The discrete time versions are conservative extensions of the discrete time versions of ACP being known as ACP dat and ACP drt. The principal version is an extension of ACP sat with integration and initial abstraction to allow for choices over an interval of time and relative timing to be expressed. Its main virtue is that it generalizes ACP without timing and most other versions of ACP with timing in a smooth and natural way. This is shown for the real time version with relative timing and the discrete time version with absolute timing.
Verifying process algebra proofs in type theory
, 1993
"... In this paper we study automatic veri cation of proofs in process algebra. Formulas of process algebra are represented by types in typedcalculus. Inhabitants (terms) of these types represent proofs. The speci c typedcalculus we use is the Calculus of Inductive Constructions as implemented in the i ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
(Show Context)
In this paper we study automatic veri cation of proofs in process algebra. Formulas of process algebra are represented by types in typedcalculus. Inhabitants (terms) of these types represent proofs. The speci c typedcalculus we use is the Calculus of Inductive Constructions as implemented in the interactive proof construction program COQ.
Verifying modal formulas over I/Oautomata by means of type theory. Logic group preprint series
, 1994
"... We introduce the notion of an I/Oautomaton over a signature. Beside we introduce a modal logic to reason about such an I/Oautomaton. The semantics of the logic is de ned in terms of a givenalgebra. We illustrate how the question whether or not an execution in a given I/Oautomaton is a model for ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
We introduce the notion of an I/Oautomaton over a signature. Beside we introduce a modal logic to reason about such an I/Oautomaton. The semantics of the logic is de ned in terms of a givenalgebra. We illustrate how the question whether or not an execution in a given I/Oautomaton is a model for formula can be reduced to an inhabitation problem in the Calculus of Inductive Constructions. Furthermore we present a proof for soundness and completeness. 1