Program analysis concerns static techniques for computing reliable approximate information
about the dynamic behaviour of programs. Applications include compilers (for code …

Programming is hard. Building a large program is like constructing a steam locomotive
through a hole the size of a postage stamp. An artefact that is the fruit of hundreds of person …

Session types support a type-theoretic formulation of structured patterns of communication,
so that the communication behaviour of agents in a distributed system can be verified by …

So far our techniques have applied equally well to typed and untyped programming
languages. This flexibility does not apply to the development to be performed in this chapter …

Abstraction and composition are the fundamental issues in making model checking viable
for software. This paper proposes new techniques for automating abstraction and …

This paper presents a type-based analysis for inferring size-and cost-equations for
recursive, higher-order and polymorphic functional programs without requiring user …

A session type is an abstraction of a set of sequences of heterogeneous values sent and
received over a communication channel. Session types can be used for specifying stream …

Key ideas in programming language design and implementation explained using a simple
and concise framework; a comprehensive introduction suitable for use as a textbook or a …

The π-calculus is a formalism of computing in which we can compositionally represent
dynamics of major programming constructs by decomposing them into a single …

This paper shows how type effect systems can be combined with model-checking
techniques to produce powerful, automatically verifiable program logics for higher-order …