• Publications
  • Influence
Mobile Ambients
This chapter introduces a calculus describing the movement of processes and devices, including movement through administrative domains.
A calculus for cryptographic protocols: the spi calculus
TLDR
The spi calculus is introduced, an extension of the pi calculus designed for describing and analyzing cryptographic protocols and state their security properties in terms of coarse-grained notions of protocol equivalence.
Concurrent Haskell
TLDR
This work has developed a freely-available implementation of Concurrent Haskell, and is now using it as a substrate for a graphical user interface toolkit.
Design and Semantics of a Decentralized Authorization Language
TLDR
An execution strategy based on translation to Datalog with Constraints, and table-based resolution is described, showing that this execution strategy is sound, complete, and always terminates, despite recursion and negation, as long as simple syntactic conditions are met.
Anytime, anywhere: modal logics for mobile ambients
TLDR
In order to describe properties of mobile computations the authors devise a modal logic that can talk about space as well as time, and that has the Ambient Calculus as a model.
Probabilistic programming
TLDR
This paper describes connections this research area called ``Probabilistic Programming" has with programming languages and software engineering, and this includes language design, and the static and dynamic analysis of programs.
Types for mobile ambients
TLDR
It is shown that a well-typed mobile computation cannot cause certain kinds of run-time fault: it cannot cause the exchange of values of the wrong kind, anywhere in a mobile system.
A lambda-calculus foundation for universal probabilistic programming
TLDR
This work adapts the classic operational semantics of λ-calculus to a continuous setting via creating a measure space on terms and defining step-indexed approximations, and proves equivalence of big-step and small-step formulations of this distribution-based semantics.
A Bisimulation Method for Cryptographic Protocols
TLDR
This work proves the soundness of the bisimulation proof technique within the spi calculus, an extension of the pi calculus with cryptographic primitives, which yields proofs of classical security properties of protocols and also justifies certain protocol optimizations.
...
...