| 2003 |
| 14 | EE | Peter V. Homeier,
David F. Martin:
Secure mechanical verification of mutually recursive procedures.
Inf. Comput. 187(1): 1-19 (2003) |
| 1998 |
| 13 | | Peter V. Homeier,
David F. Martin:
Mechanical Verification of Total Correctness through Diversion Verification Conditions.
TPHOLs 1998: 189-206 |
| 1996 |
| 12 | | Peter V. Homeier,
David F. Martin:
Mechanical Verification of Mutually Recursive Procedures.
CADE 1996: 201-215 |
| 1995 |
| 11 | | Peter V. Homeier,
David F. Martin:
A Mechanically Verified Verification Condition Generator.
Comput. J. 38(2): 131-141 (1995) |
| 1994 |
| 10 | | Peter V. Homeier,
David F. Martin:
Trustworthy Tools for Trustworthy Programs: A Verified Verification Condition Generator.
TPHOLs 1994: 269-284 |
| 1991 |
| 9 | | David F. Martin,
R. J. Toal:
Case Studies in Compiler Correctness Using HOL.
TPHOLs 1991: 242-252 |
| 1989 |
| 8 | EE | Anne F. Brindle,
Richard N. Taylor,
David F. Martin:
A Debugger for Ada Tasking.
IEEE Trans. Software Eng. 15(3): 293-304 (1989) |
| 1986 |
| 7 | EE | Laurian M. Chirica,
David F. Martin:
Toward Compiler Implementation Correctness Proofs.
ACM Trans. Program. Lang. Syst. 8(2): 185-214 (1986) |
| 1979 |
| 6 | | Laurian M. Chirica,
David F. Martin:
An Order-Algebraic Definition of Knuthian Semantics.
Mathematical Systems Theory 13: 1-27 (1979) |
| 1978 |
| 5 | | Stefano Crespi-Reghizzi,
Dino Mandrioli,
David F. Martin:
Algebraic Properties of Operator Precedence Languages
Information and Control 37(2): 115-133 (1978) |
| 1976 |
| 4 | | Laurian M. Chirica,
David F. Martin:
An Algebraic Formulation of Knuthian Semantics
FOCS 1976: 127-136 |
| 1972 |
| 3 | | David F. Martin:
A Boolean Matrix Method for the Computation of Linear Precedence Functions.
Commun. ACM 15(6): 448-454 (1972) |
| 1970 |
| 2 | | David F. Martin,
Steven A. Vere:
On Syntax-Directed Transduction and Tree Transducers
STOC 1970: 129-135 |
| 1968 |
| 1 | EE | David F. Martin:
Programming Languages: Boolean matrix methods for the detection of simple precedence grammars.
Commun. ACM 11(10): 685-687 (1968) |