#### Filter Results:

#### Publication Year

1984

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

—We consider the problem of automating open bisimulation checking for the spi-calculus, an extension of the pi-calculus with cryptographic primitives. The notion of open bisimulation considered here is indexed by a (symbolic) environment, represented as bi-traces (i.e., pairs of symbolic traces), which encode the history of interaction between the intruder… (More)

We describe an implementation of the Display Logic calculus for relation algebra as an Isabelle theory. Our implementation is the rst mechanisation of any display calculus, but also provides a useful interactive proof assistant for relation algebra. The inference rules of Display Logic are coded directly as Isabelle theorems, thereby guaranteeing the… (More)

We use a deep embedding of the display calculus for relation algebras δRA in the logical framework Isabelle/HOL to formalise a new, machine-checked, proof of strong normalisation and cut-elimination for δRA which does not use measures on the size of derivations. Our formalisation generalises easily to other display calculi and can serve as a basis for… (More)

We use a deep embedding of the display calculus for relation algebras AERA in the logical framework Isabelle/HOL to formalise a machine-checked proof of cut-admissibility for AERA. Unlike other " implementations " , we explicitly formalise the structural induction in Is-abelle/HOL and believe this to be the first full formalisation of cut-admissibility in… (More)

Received (received date) Revised (revised date) Communicated by Editor's name ABSTRACT We present a general theorem capturing conditions required for the termination of abstract reduction systems. We show that our theorem generalises another similar general theorem about termination of such systems. We apply our theorem to give interesting proofs of… (More)

We compare several methods of implementing the display (sequent) calculus RA for relation algebra in the logical frameworks Isabelle and Twelf. We aim for an implementation enabling us to for-malise within the logical framework proof-theoretic results such as the cut-elimination theorem for RA and any associated increase in proof length. We discuss issues… (More)

We describe how we used the interactive theorem prover Is-abelle to formalise and check the laws of the Timed Interval Calculus (TIC). We also describe some important corrections to, clarifications of, and flaws in these laws, found as a result of our work.

Full Intuitionistic Linear Logic (FILL) is multiplicative intuitionistic linear logic extended with par. Its proof theory has been notoriously difficult to get right, and existing sequent calculi all involve inference rules with complex annotations to guarantee soundness and cut-elimination. We give a simple and annotation-free display calculus for FILL… (More)

Full Intuitionistic Linear Logic (FILL) is multiplicative intuitionistic linear logic extended with par. Its proof theory has been notoriously difficult to get right, and existing sequent calculi all involve inference rules with complex annotations to guarantee soundness and cut-elimination. We give a simple and annotation-free display calculus for FILL… (More)