David B. Benson

According to our database1, David B. Benson
  • authored at least 32 papers between 1970 and 2004.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2004
On the Practicality and Desirability of Highly-concurrent, Mostly-functional Programming.
Proceedings of the 4th International Conference on Application of Concurrency to System Design (ACSD 2004), 2004

1995
Book Reviews.
SIGACT News, 1995

1990
Fixed Points in Free Process Algebras, Part II.
Theor. Comput. Sci., 1990

1989
Fixed Points in Free Process Algebras, Part I.
Theor. Comput. Sci., 1989

1988
Bisimulation of Automata
Inf. Comput., October, 1988

1987
Workshop Report: Third Workshop on the Mathematical Foundations of Programming Language Semantics, 1987, New Orleans.
SIGPLAN Notices, 1987

Algebraic Solutions to Recursion Schemes.
J. Comput. Syst. Sci., 1987

Concurrency and interleaving are equally fundamental.
Bulletin of the EATCS, 1987

The Shuffle Bialgebra.
Proceedings of the Mathematical Foundations of Programming Language Semantics, 1987

The Category of Milner Processes is Exact.
Proceedings of the Category Theory and Computer Science, 1987

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

1985
Free Semiring-Representations and Nondeterminism.
J. Comput. Syst. Sci., 1985

Fixed Ponts in Process Algebras with Internal Actions ( a preliminary note).
Proceedings of the Mathematical Foundations of Programming Semantics, 1985

1984
Counting Paths: Nondeterminism as Linear Algebra.
IEEE Trans. Software Eng., 1984

Functional Behvior of Nondeterministic and Concurrent Programs
Information and Control, 1984

1983
Deterministic and Nondeterministic Flowchart Interpretations.
J. Comput. Syst. Sci., 1983

Denotational Semantics for "Natural" Language Question-Answering Programs.
American Journal of Computational Linguistics, 1983

Functional Behaviour of Nondeterministic Programs.
Proceedings of the Fundamentals of Computation Theory, 1983

1982
In Scott-Strachey Style Denotational Semantics, Parallelism Implies Nondeterminism.
Mathematical Systems Theory, 1982

A machine level semantics for nondeterministic, parallel programs.
Proceedings of the International Symposium on Programming, 1982

1981
Free Upper Regular Bands.
Theor. Comput. Sci., 1981

1979
Parameter Passing in Nondeterministic Recursive Programs.
J. Comput. Syst. Sci., 1979

Tree Analysis Techniques in Tsumego.
Proceedings of the Sixth International Joint Conference on Artificial Intelligence, 1979

1977
Some Preservation Properties of Normal Form Grammars.
SIAM J. Comput., 1977

Parallel Decomposition of LR(k) Parsers (Extended Abstract).
Proceedings of the Automata, 1977

1976
Life in the game of Go.
Inf. Sci., 1976

1975
The Basic Algebraic Structures in Categories of Derivations
Information and Control, May, 1975

Semantic Preserving Translations.
Mathematical Systems Theory, 1975

1974
An Abstract Machine Theory for Formal Language Parsers.
Acta Inf., 1974

An abstract machine theory for formal language parsers.
Proceedings of the Category Theory Applied to Computation and Control, 1974

1970
Syntax and Semantics: A Categorical View
Information and Control, September, 1970

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


  Loading...