2004 |
31 | EE | Carl H. Hauser,
David B. Benson:
On the Practicality and Desirability of Highly-concurrent, Mostly-functional Programming.
ACSD 2004: 115-124 |
2000 |
30 | EE | David B. Benson:
Separating the complexity classes NL and NP
CoRR cs.CC/0004009: (2000) |
1990 |
29 | | Jerzy Tiuryn,
David B. Benson:
Fixed Points in Free Process Algebras, Part II.
Theor. Comput. Sci. 70(2): 179-192 (1990) |
1989 |
28 | | David B. Benson,
Jerzy Tiuryn:
Fixed Points in Free Process Algebras, Part I.
Theor. Comput. Sci. 63(3): 275-294 (1989) |
1988 |
27 | | David B. Benson,
Ofer Ben-Shachar:
Bisimulation of Automata
Inf. Comput. 79(1): 60-83 (1988) |
1987 |
26 | | David B. Benson:
The Category of Milner Processes is Exact.
Category Theory and Computer Science 1987: 71-97 |
25 | | David B. Benson:
The Shuffle Bialgebra.
MFPS 1987: 616-637 |
24 | | David B. Benson:
Concurrency and interleaving are equally fundamental.
Bulletin of the EATCS 33: 54 (1987) |
23 | | David B. Benson,
Irène Guessarian:
Algebraic Solutions to Recursion Schemes.
J. Comput. Syst. Sci. 35(3): 365-400 (1987) |
22 | | David B. Benson,
Michael G. Main:
Workshop Report: Third Workshop on the Mathematical Foundations of Programming Language Semantics, 1987, New Orleans.
SIGPLAN Notices 22(9): 38-43 (1987) |
1986 |
21 | | David B. Benson,
Ofer Ben-Shachar:
Strong Bisimulation of State Automata
LICS 1986: 77-81 |
1985 |
20 | | David B. Benson,
Jerzy Tiuryn:
Fixed Ponts in Process Algebras with Internal Actions ( a preliminary note).
Mathematical Foundations of Programming Semantics 1985: 53-58 |
19 | | Michael G. Main,
David B. Benson:
Free Semiring-Representations and Nondeterminism.
J. Comput. Syst. Sci. 30(3): 318-328 (1985) |
1984 |
18 | | David B. Benson:
Counting Paths: Nondeterminism as Linear Algebra.
IEEE Trans. Software Eng. 10(6): 785-794 (1984) |
17 | | Michael G. Main,
David B. Benson:
Functional Behvior of Nondeterministic and Concurrent Programs
Information and Control 62(2/3): 144-189 (1984) |
1983 |
16 | | Michael G. Main,
David B. Benson:
Functional Behaviour of Nondeterministic Programs.
FCT 1983: 290-301 |
15 | | Michael G. Main,
David B. Benson:
Denotational Semantics for ``Natural'' Language Question-Answering Programs.
American Journal of Computational Linguistics 9(1): 11-21 (1983) |
14 | | Richard J. Lorentz,
David B. Benson:
Deterministic and Nondeterministic Flowchart Interpretations.
J. Comput. Syst. Sci. 27(3): 400-433 (1983) |
1982 |
13 | | David B. Benson:
A machine level semantics for nondeterministic, parallel programs.
Symposium on Programming 1982: 15-25 |
12 | | David B. Benson:
In Scott-Strachey Style Denotational Semantics, Parallelism Implies Nondeterminism.
Mathematical Systems Theory 15(3): 267-275 (1982) |
1981 |
11 | | Michael G. Main,
David B. Benson:
Free Upper Regular Bands.
Theor. Comput. Sci. 16: 93-98 (1981) |
1979 |
10 | | David B. Benson:
Parameter Passing in Nondeterministic Recursive Programs.
J. Comput. Syst. Sci. 19(1): 50-62 (1979) |
1977 |
9 | | David B. Benson,
Ralph D. Jeffords:
Parallel Decomposition of LR(k) Parsers (Extended Abstract).
ICALP 1977: 76-86 |
8 | | David B. Benson:
Some Preservation Properties of Normal Form Grammars.
SIAM J. Comput. 6(2): 381-402 (1977) |
1976 |
7 | EE | David B. Benson:
Life in the game of Go.
Inf. Sci. 10(1): 17-29 (1976) |
1975 |
6 | | David B. Benson:
The Basic Algebraic Structures in Categories of Derivations
Information and Control 28(1): 1-29 (1975) |
5 | | David B. Benson:
Semantic Preserving Translations.
Mathematical Systems Theory 8(2): 105-126 (1975) |
1974 |
4 | | David B. Benson:
An abstract machine theory for formal language parsers.
Category Theory Applied to Computation and Control 1974: 106-111 |
3 | | David B. Benson:
An Abstract Machine Theory for Formal Language Parsers
Acta Inf. 3: 187-202 (1974) |
1970 |
2 | | David B. Benson:
Syntactic Clues
FOCS 1970: 133-138 |
1 | | David B. Benson:
Syntax and Semantics: A Categorical View
Information and Control 17(2): 145-160 (1970) |