Building a simulator in the mu mu CRL toolbox : a case-study in modern software engineering

In this paper we report on the current status of our development of a simulator tool in the $mu CRL$ Toolbox. The tool is built from (reusable) software components which are implemented in different languages like C, TCL/TK and ASF+SDF. The components communicate with each other via the ToolBus which is a new software architecture for building large, heterogeneous and distributed systems

A correctness proof of the bakery protocol in mu mu CRL

A specification of a bakery protocol is given in $mu$CRL. We provide a simple correctness criterion for the protocol. Then the protocol is proven correct using a proof system that has been developed for $mu$CRL. The proof primarily consists of algebraic manipulations based on specifications of abstract data types and elementary rules and axioms from process algebra

Formal verification of a leader election protocol in process algebra

AbstractIn 1982 Dolev, et al. [10] presented an O(nlogn) unidirectional distributed algorithm for the circular extrema-finding (or leader-election) problem. At the same time Peterson came up with a nearly identical solution. In this paper, we bring the correctness of this algorithm to a completely formal level. This relatively small protocol, which can be described on half a page, requires a rather involved proof for guaranteeing that it behaves well in all possible circumstances. To our knowledge, this is one of the more advanced case-studies in formal verification based on process algebra