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)
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 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)
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 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)