Jeremy E. Dawson

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 a collection of Isabelle theories which facilitate reasoning about machine words. For each possible word length, the words of that length form a type, and most of our work consists of generic theorems which can be applied to any such type. We develop the relationships between these words and integers (signed and unsigned), lists of booleans and(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)
In this study, we examined three maladaptive behaviors, self-injurious behavior (SIB), stereotypies, and aggression in adults with autism, pervasive developmental disorder, not otherwise specified (PDD-NOS), and mental retardation. We used a brief functional analysis rating scale. The Questions About Behavioral Functions (QABF), to examine the function of(More)
We use a deep embedding of the display calculus for relation algebras ÆRA in the logical framework Isabelle/HOL to formalise a machine-checked proof of cut-admissibility for ÆRA. Unlike other “implementations”, we explicitly formalise the structural induction in Isabelle/HOL and believe this to be the first full formalisation of cutadmissibility in 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)
reduction systems: Goubault-Larrecq’s (first) termination theorem resembles ours, but in a more general setting (but doesn’t subsume ours) We generalised our result to abstract reduction systems: We found that this also generalised Goubault-Larrecq’s result. An example using the generality: Our new result (following Goubault-Larrecq) uses a relation C in(More)