Symbolic Semantics for the Link Calculus

NEW: A web-based version of SiLVer (Symbolic links verifier ) is available here.

General Information

The link-calculus is a model for concurrency that extends the point-to-point communication discipline of Milner's CCS with multiparty interactions. Links are used to build chains describing how information flow among the different agents participating in a multiparty interaction.
The inherent non-determinism in deciding both,
the number of participants in an interaction and how they synchronize, makes difficult to devise efficient verification techniques for it. We propose a symbolic semantics for the link-calculus
which is more amenable to automating reasoning.
Unlike the operational semantics of the link-calculus, the symbolic semantics is finitely branching and it represents, compactly, a possibly infinite number of transitions. See [BO16] for further details.

This tool offers mechanisms to both generate traces of a given process and build the transition graph of a process (if it is finite).