The algebra of derivations and a semithue parser. - David B. Benson (ACM National Conference, 1969)

Syntactic Clues - David B. Benson (SWAT, 1970)

Syntax and Semantics: A Categorical View - David B. Benson (Inf. Control., 1970)

Another comment on the null word definition problem. - David B. Benson (SIGACT News, 1973)

An alternate proof of Aho & Ullman's LR(k) viable prefix theorem. - David B. Benson (SIGACT News, 1973)

An Abstract Machine Theory for Formal Language Parsers. - David B. Benson (Acta Informatica, 1974)

Semantic Preserving Translations. - David B. Benson (Math. Syst. Theory, 1975)

The Basic Algebraic Structures in Categories of Derivations - David B. Benson (Inf. Control., 1975)

Life in the game of Go. - David B. Benson (Inf. Sci., 1976)

A vector encoding technique applicable to tabular parsing methods. - Ralph D. Jeffords; David B. Benson (ACM-SE, 1977)

Parallel Decomposition of LR(k) Parsers (Extended Abstract). - David B. Benson; Ralph D. Jeffords (ICALP, 1977)

Some Preservation Properties of Normal Form Grammars. - David B. Benson (SIAM J. Comput., 1977)

Tree Analysis Techniques in Tsumego. - David B. Benson; Bruce R. Hilditch; J. Denbigh Starkey (IJCAI, 1979)

Parameter Passing in Nondeterministic Recursive Programs. - David B. Benson (J. Comput. Syst. Sci., 1979)

Free Upper Regular Bands. - Michael G. Main; David B. Benson (Theor. Comput. Sci., 1981)

A machine level semantics for nondeterministic, parallel programs. - David B. Benson (Symposium on Programming, 1982)

In Scott-Strachey Style Denotational Semantics, Parallelism Implies Nondeterminism. - David B. Benson (Math. Syst. Theory, 1982)

Functional Behaviour of Nondeterministic Programs. - Michael G. Main; David B. Benson (FCT, 1983)

Denotational Semantics for "Natural" Language Question-Answering Programs. - Michael G. Main; David B. Benson (Am. J. Comput. Linguistics, 1983)

Deterministic and Nondeterministic Flowchart Interpretations. - Richard J. Lorentz; David B. Benson (J. Comput. Syst. Sci., 1983)

Functional Behvior of Nondeterministic and Concurrent Programs - Michael G. Main; David B. Benson (Inf. Control., 1984)

Counting Paths: Nondeterminism as Linear Algebra. - David B. Benson (IEEE Trans. Software Eng., 1984)

Fixed Ponts in Process Algebras with Internal Actions ( a preliminary note). - David B. Benson; Jerzy Tiuryn (Mathematical Foundations of Programming Semantics, 1985)

Free Semiring-Representations and Nondeterminism. - Michael G. Main; David B. Benson (J. Comput. Syst. Sci., 1985)

Strong Bisimulation of State Automata - David B. Benson; Ofer Ben-Shachar (LICS, 1986)

The role of failure in successful design. - David B. Benson (ACM SIGSOFT Softw. Eng. Notes, 1986)

The Category of Milner Processes is Exact. - David B. Benson (Category Theory and Computer Science, 1987)

The Shuffle Bialgebra. - David B. Benson (MFPS, 1987)

Concurrency and interleaving are equally fundamental. - David B. Benson (Bull. EATCS, 1987)

Algebraic Solutions to Recursion Schemes. - David B. Benson; Irène Guessarian (J. Comput. Syst. Sci., 1987)

Workshop Report: Third Workshop on the Mathematical Foundations of Programming Language Semantics, 1987, New Orleans. - David B. Benson; Michael G. Main (ACM SIGPLAN Notices, 1987)

Bisimulation of Automata - David B. Benson; Ofer Ben-Shachar (Inf. Comput., 1988)

Fixed Points in Free Process Algebras, Part I. - David B. Benson; Jerzy Tiuryn (Theor. Comput. Sci., 1989)

Fixed Points in Free Process Algebras, Part II. - Jerzy Tiuryn; David B. Benson (Theor. Comput. Sci., 1990)

Book Reviews. - Stephen R. Tate; David B. Benson; Jonathan Goldstine (SIGACT News, 1995)

On the Practicality and Desirability of Highly-concurrent, Mostly-functional Programming. - Carl H. Hauser; David B. Benson (ACSD, 2004)