David B. Benson

According to our database, David B. Benson authored at least 36 papers between 1969 and 2004.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2004

On the Practicality and Desirability of Highly-concurrent, Mostly-functional Programming.

Carl H. Hauser, David B. Benson

Proceedings of the 4th International Conference on Application of Concurrency to System Design (ACSD 2004), 2004

1995

Book Reviews.

Stephen R. Tate, David B. Benson, Jonathan Goldstine

SIGACT News, 1995

1990

Fixed Points in Free Process Algebras, Part II.

Jerzy Tiuryn, David B. Benson

Theor. Comput. Sci., 1990

1989

Fixed Points in Free Process Algebras, Part I.

David B. Benson, Jerzy Tiuryn

Theor. Comput. Sci., 1989

1988

Bisimulation of Automata

David B. Benson, Ofer Ben-Shachar

Inf. Comput., October, 1988

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

Algebraic Solutions to Recursion Schemes.

David B. Benson, Irène Guessarian

J. Comput. Syst. Sci., 1987

Concurrency and interleaving are equally fundamental.

David B. Benson

Bull. EATCS, 1987

The Shuffle Bialgebra.

David B. Benson

Proceedings of the Mathematical Foundations of Programming Language Semantics, 1987

The Category of Milner Processes is Exact.

David B. Benson

Proceedings of the Category Theory and Computer Science, 1987

1986

The role of failure in successful design.

David B. Benson

ACM SIGSOFT Softw. Eng. Notes, 1986

Strong Bisimulation of State Automata

David B. Benson, Ofer Ben-Shachar

Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

1985

Free Semiring-Representations and Nondeterminism.

Michael G. Main, David B. Benson

J. Comput. Syst. Sci., 1985

Fixed Ponts in Process Algebras with Internal Actions ( a preliminary note).

David B. Benson, Jerzy Tiuryn

Proceedings of the Mathematical Foundations of Programming Semantics, 1985

1984

Counting Paths: Nondeterminism as Linear Algebra.

David B. Benson

IEEE Trans. Software Eng., 1984

Functional Behvior of Nondeterministic and Concurrent Programs

Michael G. Main, David B. Benson

Inf. Control., 1984

1983

Deterministic and Nondeterministic Flowchart Interpretations.

Richard J. Lorentz, David B. Benson

J. Comput. Syst. Sci., 1983

Denotational Semantics for "Natural" Language Question-Answering Programs.

Michael G. Main, David B. Benson

Am. J. Comput. Linguistics, 1983

Functional Behaviour of Nondeterministic Programs.

Michael G. Main, David B. Benson

Proceedings of the Fundamentals of Computation Theory, 1983

1982

In Scott-Strachey Style Denotational Semantics, Parallelism Implies Nondeterminism.

David B. Benson

Math. Syst. Theory, 1982

A machine level semantics for nondeterministic, parallel programs.

David B. Benson

Proceedings of the International Symposium on Programming, 1982

1981

Free Upper Regular Bands.

Michael G. Main, David B. Benson

Theor. Comput. Sci., 1981

1979

Parameter Passing in Nondeterministic Recursive Programs.

David B. Benson

J. Comput. Syst. Sci., 1979

Tree Analysis Techniques in Tsumego.

David B. Benson, Bruce R. Hilditch, J. Denbigh Starkey

Proceedings of the Sixth International Joint Conference on Artificial Intelligence, 1979

1977

Some Preservation Properties of Normal Form Grammars.

David B. Benson

SIAM J. Comput., 1977

Parallel Decomposition of LR(k) Parsers (Extended Abstract).

David B. Benson, Ralph D. Jeffords

Proceedings of the Automata, 1977

A vector encoding technique applicable to tabular parsing methods.

Ralph D. Jeffords, David B. Benson

Proceedings of the 15th annual Southeast regional conference, 1977

1976

Life in the game of Go.

David B. Benson

Inf. Sci., 1976

1975

The Basic Algebraic Structures in Categories of Derivations

David B. Benson

Inf. Control., May, 1975

Semantic Preserving Translations.

David B. Benson

Math. Syst. Theory, 1975

1974

An Abstract Machine Theory for Formal Language Parsers.

David B. Benson

Acta Informatica, 1974

1973

An alternate proof of Aho & Ullman's LR(k) viable prefix theorem.

David B. Benson

SIGACT News, 1973

Another comment on the null word definition problem.

David B. Benson

SIGACT News, 1973

1970

Syntax and Semantics: A Categorical View

David B. Benson

Inf. Control., September, 1970

Syntactic Clues

David B. Benson

Proceedings of the 11th Annual Symposium on Switching and Automata Theory, 1970

1969

The algebra of derivations and a semithue parser.

David B. Benson

Proceedings of the 24th national conference, 1969