Department of Informatics
University of Sussex
Falmer
Brighton BN1 9QJ, UK
Room: Chichester II, 312
M.F.Berger@sussex.ac....REM.OVE...uk
01273678770
Skype: martinfri...REM.OVE...edrichberger

Computer Networks (G5115)

My interview with Robin Milner.

• Program Logics for Homogeneous Meta-Programming
• Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes
• Program Logics for Sequential Higher-Order Control
• Timed, Distributed, Probabilistic, Typed Processes
• Distributed Liveness and Timers for Mobile Processes
• Logical Reasoning for Higher-Order Functions with Local State
• Descriptive and Relative Completeness of Logics for Higher-Order Functions
• A Logical Analysis of Aliasing in Imperative Higher-Order Functions
• An Observationally Complete Program Logic for Imperative Higher-Order Functions
• Control in the Pi-Calculus
• Basic Theory of Reduction Congruence for Two Timed Asynchronous Pi-Calculi
• The Church-Turing Thesis and Timed Computations
• Genericity and the Pi-Calculus
• Linearity and Bisimulation
• (Almost) Every Process Calculus has a Compositional and Fully Abstract Encoding into Pi-Calculi
• Strong Normalisation in the Pi-Calculus
• Sequentiality and the Pi-Calculus
• Towards Abstractions for Distributed Systems
• The Two-Phase Commit Protocol in an Extended Pi-Calculus
• A Graph-Type Based Deadlock Detection Algorithm
• Remarks on the Correctness of Certain Compiler Directed Storage Reclamation Schemes
• An Exemplary Optimising Compiler