The mobility workbench — A tool for the π-Calculus

Victor, Björn; Moller, Faron

doi:10.1007/3-540-58179-0_73

Cited by 159 publications

(117 citation statements)

References 12 publications

(19 reference statements)

Supporting

Mentioning

103

Contrasting

Unclassified

Order By: Relevance

“…de Bruijn indices are heavily used in software which reasons about terms with binders; an example for the π-calculus is the Mobility Workbench [46]. They work well in these environments as they have very nice algorithmic properties.…”

Section: Results and Conclusionmentioning

confidence: 99%

Formalising the pi-calculus using nominal logic

Bengtson¹,

Parrow²

2009

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. We formalise the pi-calculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpose is to derive powerful induction rules for the semantics in order to conduct machine checkable proofs, closely following the intuitive arguments found in manual proofs. In this way we have covered many of the standard theorems of bisimulation equivalence and congruence, both late and early, and both strong and weak in a uniform manner. We thus provide one of the most extensive formalisations of a process calculus ever done inside a theorem prover.A significant gain in our formulation is that agents are identified up to alpha-equivalence, thereby greatly reducing the arguments about bound names. This is a normal strategy for manual proofs about the pi-calculus, but that kind of hand waving has previously been difficult to incorporate smoothly in an interactive theorem prover. We show how the nominal logic formalism and its support in Isabelle accomplishes this and thus significantly reduces the tedium of conducting completely formal proofs. This improves on previous work using weak higher order abstract syntax since we do not need extra assumptions to filter out exotic terms and can keep all arguments within a familiar first-order logic.

show abstract

Section: Results and Conclusionmentioning

confidence: 99%

Formalising the pi-calculus using nominal logic

Bengtson¹,

Parrow²

2009

Logical Methods in Computer Science

View full text Add to dashboard Cite

show abstract

“…We now present some benchmark figures, comparing with other existing π-calculus model-checkers: the Petruchio tool [11], the Mobility Workbench (MWB) [15], and the Mobility Model Checker (MMC) [18]. The comparison is established for the verification of a fundamental behavioral property: deadlock absence.…”

Section: Verification Algorithms and Implementationmentioning

confidence: 99%

“…Its base logic is a very rich dynamical spatial logic for concurrency, conveniently containing as a subset the logics supported by other model-checkers for π-calculi (e.g., [15,11,18]). The verification algorithm (using on-the-fly techniques) is provably correct for all expressible processes, and complete for the class of bounded processes [4], including the finite control π-calculus.…”

Section: Introductionmentioning

confidence: 99%

SLMC: A Tool for Model Checking Concurrent Systems against Dynamical Spatial Logic Specifications

Caires

Vieira

2012

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. The Spatial Logic Model Checker is a tool for verifying π-calculus systems against safety, liveness, and structural properties expressed in the spatial logic for concurrency of Caires and Cardelli. Model-checking is one of the most widely used techniques to check temporal properties of software systems. However, when the analysis focuses on properties related to resource usage, localities, interference, mobility, or topology, it is crucial to reason about spatial properties and structural dynamics. The SLMC is the only currently available tool that supports the combined analysis of behavioral and spatial properties of systems. The implementation, written in OCAML, is mature and robust, available in open source, and outperforms other tools for verifying systems modeled in π-calculus.

show abstract

“…In particular, we consider the π-calculus specification of the Handover Protocol for Mobile Telephones borrowed from that given in [17] (which has been in turn derived from that in [13]). …”

Section: Verifying Mobile Systems With Mihdamentioning

confidence: 99%

From Co-algebraic Specifications to Implementation: The Mihda Toolkit

Ferrari

Montanari

Raggi

et al. 2003

Formal Methods for Components and Objects

View full text Add to dashboard Cite

Abstract. This paper describes the architecture of a toolkit, called Mihda, providing facilities to minimise labelled transition systems for name passing calculi. The structure of the toolkit is derived from the co-algebraic formulation of the partition-refinement minimisation algorithm for HD-automata. HD-automata have been specifically designed to allocate and garbage collect names and they provide faithful finite state representations of the behaviours of π-calculus processes. The direct correspondence between the coalgebraic specification and the implementation structure facilitates the proof of correctness of the implementation. We evaluate the usefulness of Mihda in practise by performing finite state verification of π-calculus specifications.

show abstract

The mobility workbench — A tool for the π-Calculus

Cited by 159 publications

References 12 publications

Formalising the pi-calculus using nominal logic

Formalising the pi-calculus using nominal logic

SLMC: A Tool for Model Checking Concurrent Systems against Dynamical Spatial Logic Specifications

From Co-algebraic Specifications to Implementation: The Mihda Toolkit

Contact Info

Product

Resources

About