| 2007 |
| 7 | EE | Francine Bacchini,
Alan J. Hu,
Tom Fitzpatrick,
Rajeev Ranjan,
David Lacey,
Mercedes Tan,
Andrew Piziali,
Avi Ziv:
Verification Coverage: When is Enough, Enough?
DAC 2007: 744-745 |
| 2006 |
| 6 | EE | Simon Hammond,
David Lacey:
Loop Transformations in the Ahead-of-Time Optimization of Java Bytecode.
CC 2006: 109-123 |
| 2004 |
| 5 | EE | David Lacey,
Neil D. Jones,
Eric Van Wyk,
Carl Christian Frederiksen:
Compiler Optimization Correctness by Temporal Logic.
Higher-Order and Symbolic Computation 17(3): 173-206 (2004) |
| 2003 |
| 4 | EE | Oege de Moor,
David Lacey,
Eric Van Wyk:
Universal Regular Path Queries.
Higher-Order and Symbolic Computation 16(1-2): 15-35 (2003) |
| 2002 |
| 3 | EE | David Lacey,
Neil D. Jones,
Eric Van Wyk,
Carl Christian Frederiksen:
Proving correctness of compiler optimizations by temporal logic.
POPL 2002: 283-294 |
| 2001 |
| 2 | EE | David Lacey,
Oege de Moor:
Imperative Program Transformation by Rewriting.
CC 2001: 52-68 |
| 2000 |
| 1 | EE | David Lacey,
Julian Richardson,
Alan Smaill:
Logic Program Synthesis in a Higher-Order Setting.
Computational Logic 2000: 87-100 |