|
Search the dblp DataBase
David Lacey:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Simon Hammond, David Lacey
Loop Transformations in the Ahead-of-Time Optimization of Java Bytecode. [Citation Graph (0, 0)][DBLP] CC, 2006, pp:109-123 [Conf]
- David Lacey, Oege de Moor
Imperative Program Transformation by Rewriting. [Citation Graph (0, 0)][DBLP] CC, 2001, pp:52-68 [Conf]
- David Lacey, Julian Richardson, Alan Smaill
Logic Program Synthesis in a Higher-Order Setting. [Citation Graph (0, 0)][DBLP] Computational Logic, 2000, pp:87-100 [Conf]
- David Lacey, Neil D. Jones, Eric Van Wyk, Carl Christian Frederiksen
Proving correctness of compiler optimizations by temporal logic. [Citation Graph (0, 0)][DBLP] POPL, 2002, pp:283-294 [Conf]
- David Lacey, Neil D. Jones, Eric Van Wyk, Carl Christian Frederiksen
Compiler Optimization Correctness by Temporal Logic. [Citation Graph (0, 0)][DBLP] Higher-Order and Symbolic Computation, 2004, v:17, n:3, pp:173-206 [Journal]
- Oege de Moor, David Lacey, Eric Van Wyk
Universal Regular Path Queries. [Citation Graph (0, 0)][DBLP] Higher-Order and Symbolic Computation, 2003, v:16, n:1-2, pp:15-35 [Journal]
- Francine Bacchini, Alan J. Hu, Tom Fitzpatrick, Rajeev Ranjan, David Lacey, Mercedes Tan, Andrew Piziali, Avi Ziv
Verification Coverage: When is Enough, Enough? [Citation Graph (0, 0)][DBLP] DAC, 2007, pp:744-745 [Conf]
Search in 0.001secs, Finished in 0.002secs
|