David B. Benson

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