Lazy type inference for the strictness analysis of lists, ESOP'94, LNCS 788 (with D. Le Metayer)..
A type-based framework for program analysis, SAS'94, LNCS 864 (with D. Le Metayer)..
Lazy Type Inference and Program Analysis, Science of Computer Programming, Vol 25, 1995 (with D. Le Metayer)..
A new approach to Control Flow Analysis, CC'98, LNCS 1383 (with P. Malacaria)..
Generalised Flowcharts and Games, ICALP'98, LNCS 1443 (with P. Malacaria)..
Program Analysis Tools, Software Tools for Technology Transfer, 2(1), 1998..
Non-deterministic Games and Program Analysis: An application to security, LICS'99, IEEE Press (with P. Malacaria).
Safety of Strictness Analysis via Term Graph Rewriting, SAS'00, LNCS ???, 2000 (with D. Clark and S. Hunt).
Possibilistic Information Flow is safe for Probabilistic Non-interference, WITS'00, July 2000 (with D Clark, S Hunt and R Nagarajan).
Principles of Program Analysis, Springer Verlag, 1999 (with F. Nielson and H. R. Nielson)