David B. Benson

Publication Activity (10 Years)

Years Active: 1969-2004
Publications (10 Years): 0

Publications

Carl H. Hauser, David B. Benson
On the Practicality and Desirability of Highly-concurrent, Mostly-functional Programming. ACSD (2004)
Stephen R. Tate, David B. Benson, Jonathan Goldstine
Book Reviews. SIGACT News 26 (2) (1995)
Jerzy Tiuryn, David B. Benson
Fixed Points in Free Process Algebras, Part II. Theor. Comput. Sci. 70 (2) (1990)
David B. Benson, Jerzy Tiuryn
Fixed Points in Free Process Algebras, Part I. Theor. Comput. Sci. 63 (3) (1989)
David B. Benson, Ofer Ben-Shachar
Bisimulation of Automata Inf. Comput. 79 (1) (1988)
David B. Benson
The Shuffle Bialgebra. MFPS (1987)
David B. Benson
The Category of Milner Processes is Exact. Category Theory and Computer Science (1987)
David B. Benson
Concurrency and interleaving are equally fundamental. Bull. EATCS 33 (1987)
David B. Benson, Michael G. Main
Workshop Report: Third Workshop on the Mathematical Foundations of Programming Language Semantics, 1987, New Orleans. ACM SIGPLAN Notices 22 (9) (1987)
David B. Benson, Irène Guessarian
Algebraic Solutions to Recursion Schemes. J. Comput. Syst. Sci. 35 (3) (1987)
David B. Benson
The role of failure in successful design. ACM SIGSOFT Softw. Eng. Notes 11 (1) (1986)
David B. Benson, Ofer Ben-Shachar
Strong Bisimulation of State Automata LICS (1986)
David B. Benson, Jerzy Tiuryn
Fixed Ponts in Process Algebras with Internal Actions ( a preliminary note). Mathematical Foundations of Programming Semantics (1985)
Michael G. Main, David B. Benson
Free Semiring-Representations and Nondeterminism. J. Comput. Syst. Sci. 30 (3) (1985)
Michael G. Main, David B. Benson
Functional Behvior of Nondeterministic and Concurrent Programs Inf. Control. 62 (2/3) (1984)
David B. Benson
Counting Paths: Nondeterminism as Linear Algebra. IEEE Trans. Software Eng. 10 (6) (1984)
Michael G. Main, David B. Benson
Functional Behaviour of Nondeterministic Programs. FCT (1983)
Richard J. Lorentz, David B. Benson
Deterministic and Nondeterministic Flowchart Interpretations. J. Comput. Syst. Sci. 27 (3) (1983)
Michael G. Main, David B. Benson
Denotational Semantics for "Natural" Language Question-Answering Programs. Am. J. Comput. Linguistics 9 (1) (1983)
David B. Benson
A machine level semantics for nondeterministic, parallel programs. Symposium on Programming (1982)
David B. Benson
In Scott-Strachey Style Denotational Semantics, Parallelism Implies Nondeterminism. Math. Syst. Theory 15 (3) (1982)
Michael G. Main, David B. Benson
Free Upper Regular Bands. Theor. Comput. Sci. 16 (1981)
David B. Benson
Parameter Passing in Nondeterministic Recursive Programs. J. Comput. Syst. Sci. 19 (1) (1979)
David B. Benson, Bruce R. Hilditch, J. Denbigh Starkey
Tree Analysis Techniques in Tsumego. IJCAI (1979)
Ralph D. Jeffords, David B. Benson
A vector encoding technique applicable to tabular parsing methods. ACM-SE (1977)
David B. Benson
Some Preservation Properties of Normal Form Grammars. SIAM J. Comput. 6 (2) (1977)
David B. Benson, Ralph D. Jeffords
Parallel Decomposition of LR(k) Parsers (Extended Abstract). ICALP (1977)
David B. Benson
Life in the game of Go. Inf. Sci. 10 (1) (1976)
David B. Benson
Semantic Preserving Translations. Math. Syst. Theory 8 (2) (1975)
David B. Benson
The Basic Algebraic Structures in Categories of Derivations Inf. Control. 28 (1) (1975)
David B. Benson
An abstract machine theory for formal language parsers. Category Theory Applied to Computation and Control (1974)
David B. Benson
An Abstract Machine Theory for Formal Language Parsers. Acta Informatica 3 (1974)
David B. Benson
An alternate proof of Aho & Ullman's LR(k) viable prefix theorem. SIGACT News 5 (4) (1973)
David B. Benson
Another comment on the null word definition problem. SIGACT News 5 (1) (1973)
David B. Benson
Syntax and Semantics: A Categorical View Inf. Control. 17 (2) (1970)
David B. Benson
Syntactic Clues SWAT (1970)
David B. Benson
The algebra of derivations and a semithue parser. ACM National Conference (1969)