David Clark gained his PhD at Imperial College in 1996, supervised by Chris Hankin. His thesis work addressed the problem of the correctness of the strictness analyser in the CLEAN compiler, also the subject of a later paper with Chris Hankin and Sebastian Hunt [3]. He was a co-writer of the EPSRC grant proposal ``Abstract Interpretation of Safety Critical Systems'' (GR/L80065/01(P)) and was subsequently employed on that grant as an RA from 1998-2000. He was appointed as a lecturer at the Department of Computer Science, King's College London, in 2001. He has continued to work on safety related and embedded systems with Kevin Lano and others since being appointed to King's College: he was on the program committee for ROOM 2002 and has recently been working with Juan Bicarregui on safety critical system visualisation.
His current interests include security, particularly language-based security properties as well as data mining for unsupervised fraud and intrusion detection. In 2001/2 he collaborated with Hankin and Hunt on the analysis of dependency in Algol-like languages [2].
Sebastian Hunt has been a lecturer in the Department of Computing at City University since 1992. Prior to that, he was employed as an RA on the European grants Semantique (BRA 3124) and Semagraph (BRA 3074). While working as an RA he also studied for his PhD, supervised by Chris Hankin, awarded in 1992. While at City he has been the holder of a Nuffield Foundation grant and an EPSRC travel grant. In [10,11,12] he pioneered the use of abstract interpretation over lattices of relations for the analysis of various types of dependency in software. In 2001/2 he collaborated with Clark and Hankin on the analysis of dependency in Algol-like languages [2]. In 2003 he presented joint work with Clark and Malacaria on quantitative information flow [5] as an invited participant in the 2003 Dagstuhl Seminar on Language Based Security (Dagstuhl Seminar 03411). He was organising co-chair for PLID 2004.
His current research interests include program analysis and abstract interpretation, particularly in application to problems in language-based security.
Pasquale Malacaria did his masters thesis in Rome with lambda calculus scientist C. Bohm followed by a PhD in Paris with Linear Logic creator J.Y. Girard on Stone Duality for sequential functions. He then moved to London where he coauthored the paper ``Full abstraction for PCF'' with S. Abramsky and R. Jagadeesan [1]. The paper, by building a syntax independent model of PCF (a long standing open problem in the semantics of programming languages), established Game semantics as an important tool in the semantics of programming languages and was pivotal in the creation of this new research field.
In 1996 he was awarded an EPSRC Advanced Fellowship to further his work on Game semantics. He has worked with Chris Hankin at Imperial College on applications of Game semantics to program analysis, collaboration which led to the publication of several algorithms for program analysis based on Game semantics [13,14].
His interests vary from theoretical investigations to software writing. He has implemented a control flow analyser for an object oriented lambda calculus, a model checker for the mu-calculus and several other research-based and educational systems.
Malacaria has held two EPSRC grants B/95/AF/2115 and two European Community grants (Human Capital and Mobility fellowship and BRA6811) and has been co-investigator in the EPSRC grant GR/L40403.
He has also been supervisor of an EPSRC funded PhD student, Russ Harmer, who successfully completed his PhD in 1999 and is now ``charge de recherche'' at CNRS in Paris.