This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...
In this paper, we comparatively analyze some mainstream calculi for mobility and distribution, together with some of their variants: asynchronous -calculus, distributed -calculus,...
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...