default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid F. Martin
Person information
- affiliation: University of California, Los Angeles, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2003
[j14]Peter V. Homeier, David F. Martin:
Secure mechanical verification of mutually recursive procedures. Inf. Comput. 187(1): 1-19 (2003)- 1995
- [j13]Peter V. Homeier, David F. Martin:
A Mechanically Verified Verification Condition Generator. Comput. J. 38(2): 131-141 (1995) - 1989
- [j12]Anne F. Brindle, Richard N. Taylor, David F. Martin:
A Debugger for Ada Tasking. IEEE Trans. Software Eng. 15(3): 293-304 (1989) - 1986
- [j11]Laurian M. Chirica, David F. Martin:
Toward Compiler Implementation Correctness Proofs. ACM Trans. Program. Lang. Syst. 8(2): 185-214 (1986) - 1979
- [j10]Laurian M. Chirica, David F. Martin:
An Order-Algebraic Definition of Knuthian Semantics. Math. Syst. Theory 13: 1-27 (1979) - 1978
- [j9]Stefano Crespi-Reghizzi, Dino Mandrioli, David F. Martin:
Algebraic Properties of Operator Precedence Languages. Inf. Control. 37(2): 115-133 (1978) - [j8]Daniel M. Berry, Laurian M. Chirica, John B. Johnston, David F. Martin, Arthur Sorkin:
Time required for reference count management in retention block-structured languages. Part 1. Int. J. Parallel Program. 7(1): 11-64 (1978) - [j7]Daniel M. Berry, Laurian M. Chirica, John B. Johnston, David F. Martin, Arthur Sorkin:
On the time required for reference count management in retention block-structured languages. Part 2. Int. J. Parallel Program. 7(2): 91-119 (1978) - 1972
- [j6]David F. Martin:
A Boolean Matrix Method for the Computation of Linear Precedence Functions. Commun. ACM 15(6): 448-454 (1972) - 1969
- [j5]David F. Martin, Gerald Estrin:
Path Length Computations on Graph Models of Computations. IEEE Trans. Computers 18(6): 530-536 (1969) - 1968
- [j4]David F. Martin:
Programming Languages: Boolean matrix methods for the detection of simple precedence grammars. Commun. ACM 11(10): 685-687 (1968) - 1967
- [j3]David F. Martin, Gerald Estrin:
Models of Computations and Systems - Evaluation of Vertex Probabilities in Graph Models of Computations. J. ACM 14(2): 281-299 (1967) - [j2]David F. Martin, Gerald Estrin:
Experiments on Models of Computations and Systems. IEEE Trans. Electron. Comput. 16(1): 59-69 (1967) - [j1]David F. Martin, Gerald Estrin:
Models of Computational Systems-Cyclic to Acyclic Graph Transformations. IEEE Trans. Electron. Comput. 16(1): 70-79 (1967)
Conference and Workshop Papers
- 1998
- [c10]Peter V. Homeier, David F. Martin:
Mechanical Verification of Total Correctness through Diversion Verification Conditions. TPHOLs 1998: 189-206 - 1996
- [c9]Peter V. Homeier, David F. Martin:
Mechanical Verification of Mutually Recursive Procedures. CADE 1996: 201-215 - 1994
- [c8]Peter V. Homeier, David F. Martin:
Trustworthy Tools for Trustworthy Programs: A Verified Verification Condition Generator. TPHOLs 1994: 269-284 - 1991
- [c7]David F. Martin, R. J. Toal:
Case Studies in Compiler Correctness Using HOL. TPHOLs 1991: 242-252 - 1982
- [c6]Vittal Kini, David F. Martin, Allen Stoughton:
Testing the INRIA Ada formal definition: the USC-ISI formal semantics project. AdaTEC Conference on Ada 1982: 120-128 - 1976
- [c5]Laurian M. Chirica, David F. Martin:
An Algebraic Formulation of Knuthian Semantics. FOCS 1976: 127-136 - 1975
- [c4]Laurian M. Chirica, David F. Martin:
An approach to compiler correctness. Reliable Software 1975: 96-103 - 1973
- [c3]Laurian M. Chirica, David F. Martin, Timothy A. Dreisbach, J. G. Peetz, Arthur Sorkin:
Two PARALLEL EULER run time models: The dangling reference, impostor environment, and label problems. HLLCA 1973: 141-151 - [c2]Daniel M. Berry, Laurian M. Chirica, John B. Johnston, David F. Martin, Arthur Sorkin:
On the time required for retention. HLLCA 1973: 165-178 - 1970
- [c1]David F. Martin, Steven A. Vere:
On Syntax-Directed Transduction and Tree Transducers. STOC 1970: 129-135
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
