Results 1 
4 of
4
Algebraic Process Verification
 Handbook of Process Algebra, chapter 17
"... This chapter addresses the question how to verify distributed and communicating systems in an e#ective way from an explicit process algebraic standpoint. This means that all calculations are based on the axioms and principles of the process algebras. ..."
Abstract

Cited by 75 (16 self)
 Add to MetaCart
This chapter addresses the question how to verify distributed and communicating systems in an e#ective way from an explicit process algebraic standpoint. This means that all calculations are based on the axioms and principles of the process algebras.
On automating process algebra proofs
 Proceedings of the 11th International Symposium on Computer and Information Sciences, ISCIS XI
, 1996
"... In [10] Groote and Springintveld incorporated several modeloriented techniques { such asinvariants, matching criteria, state mappings { in the processalgebraic framework of CRL for structuring and simplifying protocol veri cations. In this paper, we formalise these extensions in Coq, which is a pr ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
In [10] Groote and Springintveld incorporated several modeloriented techniques { such asinvariants, matching criteria, state mappings { in the processalgebraic framework of CRL for structuring and simplifying protocol veri cations. In this paper, we formalise these extensions in Coq, which is a proof development tool based on type theory. In the updated framework, the length of proof constructions is reduced significantly. Moreover, the new approach allows for more automation (proof generation) than was possible in the past. The results are illustrated by an example in which we prove two queue representations equal. 1
The Bakery Protocol: A Comparative CaseStudy in Formal Verification
"... Groote and the second author verified (a version of) the Bakery Protocol in CRL. Their processalgebraic verification is rather complex compared to the protocol. Now the question is: How do other verification techniques perform on this protocol? In this paper, we present a new correctness proof by u ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Groote and the second author verified (a version of) the Bakery Protocol in CRL. Their processalgebraic verification is rather complex compared to the protocol. Now the question is: How do other verification techniques perform on this protocol? In this paper, we present a new correctness proof by using I/Oautomata theory and discuss the relative merits of both approaches.
Formalising LPOs and Invariants in Coq
"... In the setting of CRL, the notions of `linear process operator (LPO) ' and `invariant' are implemented in Coq, which isa a proof development tool based on type theory. As a rst experiment wehavecomputerchecked a general property of a binary search program in the new framework. 1 ..."
Abstract
 Add to MetaCart
In the setting of CRL, the notions of `linear process operator (LPO) ' and `invariant' are implemented in Coq, which isa a proof development tool based on type theory. As a rst experiment wehavecomputerchecked a general property of a binary search program in the new framework. 1