Computer assisted manipulation of algebraic process specifications
ACM SIGPLAN Notices
µCRL: A Toolset for Analysing Algebraic Specifications
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
State Space Reduction by Proving Confluence
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Cones and foci: A mechanical framework for protocol verification
Formal Methods in System Design
Axiomatizations for probabilistic finite-state behaviors
Theoretical Computer Science
An abstract interpretation toolkit for μCRL
Formal Methods in System Design
An Abstract Interpretation Toolkit for μCRL
Electronic Notes in Theoretical Computer Science (ENTCS)
A BDD-Representation for the logic of equality and uninterpreted functions
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
This document describes an automated theorem prover, based on an extension of binary decision diagrams. The prover transforms quantifier-free formulae into equivalent BDD-forms, w.r.t.~to some algebraic data specification. The prover is used by four tools for the symbolic analysis of distributed systems specified in $\mu$CRL (i.e.~process algebra plus algebraic data types). The main techniques are invariants and confluence. Two case studies are reported: the DKR leader election protocol [13], and SPLICE [15], a coordination architecture of industrial origin. In both cases using confluence information leads to a reduced state space.