default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid B. Benson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[c13]Carl H. Hauser, David B. Benson:
On the Practicality and Desirability of Highly-concurrent, Mostly-functional Programming. ACSD 2004: 115-124
1990 – 1999
- 1995
- [j24]Stephen R. Tate, David B. Benson, Jonathan Goldstine:
Book Reviews. SIGACT News 26(2): 26-32 (1995) - 1990
- [j23]Jerzy Tiuryn, David B. Benson:
Fixed Points in Free Process Algebras, Part II. Theor. Comput. Sci. 70(2): 179-192 (1990)
1980 – 1989
- 1989
- [j22]David B. Benson, Jerzy Tiuryn:
Fixed Points in Free Process Algebras, Part I. Theor. Comput. Sci. 63(3): 275-294 (1989) - 1988
- [j21]David B. Benson, Ofer Ben-Shachar:
Bisimulation of Automata. Inf. Comput. 79(1): 60-83 (1988) - 1987
- [j20]David B. Benson:
Concurrency and interleaving are equally fundamental. Bull. EATCS 33: 54 (1987) - [j19]David B. Benson, Irène Guessarian:
Algebraic Solutions to Recursion Schemes. J. Comput. Syst. Sci. 35(3): 365-400 (1987) - [j18]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): 38-43 (1987) - [c12]David B. Benson:
The Category of Milner Processes is Exact. Category Theory and Computer Science 1987: 71-97 - [c11]David B. Benson:
The Shuffle Bialgebra. MFPS 1987: 616-637 - 1986
- [j17]David B. Benson:
The role of failure in successful design. ACM SIGSOFT Softw. Eng. Notes 11(1): 15 (1986) - [c10]David B. Benson, Ofer Ben-Shachar:
Strong Bisimulation of State Automata. LICS 1986: 77-81 - 1985
- [j16]Michael G. Main, David B. Benson:
Free Semiring-Representations and Nondeterminism. J. Comput. Syst. Sci. 30(3): 318-328 (1985) - [c9]David B. Benson, Jerzy Tiuryn:
Fixed Ponts in Process Algebras with Internal Actions ( a preliminary note). Mathematical Foundations of Programming Semantics 1985: 53-58 - 1984
- [j15]Michael G. Main, David B. Benson:
Functional Behvior of Nondeterministic and Concurrent Programs. Inf. Control. 62(2/3): 144-189 (1984) - [j14]David B. Benson:
Counting Paths: Nondeterminism as Linear Algebra. IEEE Trans. Software Eng. 10(6): 785-794 (1984) - 1983
- [j13]Michael G. Main, David B. Benson:
Denotational Semantics for "Natural" Language Question-Answering Programs. Am. J. Comput. Linguistics 9(1): 11-21 (1983) - [j12]Richard J. Lorentz, David B. Benson:
Deterministic and Nondeterministic Flowchart Interpretations. J. Comput. Syst. Sci. 27(3): 400-433 (1983) - [c8]Michael G. Main, David B. Benson:
Functional Behaviour of Nondeterministic Programs. FCT 1983: 290-301 - 1982
- [j11]David B. Benson:
In Scott-Strachey Style Denotational Semantics, Parallelism Implies Nondeterminism. Math. Syst. Theory 15(3): 267-275 (1982) - [c7]David B. Benson:
A machine level semantics for nondeterministic, parallel programs. Symposium on Programming 1982: 15-25 - 1981
- [j10]Michael G. Main, David B. Benson:
Free Upper Regular Bands. Theor. Comput. Sci. 16: 93-98 (1981)
1970 – 1979
- 1979
- [j9]David B. Benson:
Parameter Passing in Nondeterministic Recursive Programs. J. Comput. Syst. Sci. 19(1): 50-62 (1979) - [c6]David B. Benson, Bruce R. Hilditch, J. Denbigh Starkey:
Tree Analysis Techniques in Tsumego. IJCAI 1979: 50-52 - 1977
- [j8]David B. Benson:
Some Preservation Properties of Normal Form Grammars. SIAM J. Comput. 6(2): 381-402 (1977) - [c5]Ralph D. Jeffords, David B. Benson:
A vector encoding technique applicable to tabular parsing methods. ACM-SE 1977: 140-153 - [c4]David B. Benson, Ralph D. Jeffords:
Parallel Decomposition of LR(k) Parsers (Extended Abstract). ICALP 1977: 76-86 - 1976
- [j7]David B. Benson:
Life in the game of Go. Inf. Sci. 10(1): 17-29 (1976) - 1975
- [j6]David B. Benson:
The Basic Algebraic Structures in Categories of Derivations. Inf. Control. 28(1): 1-29 (1975) - [j5]David B. Benson:
Semantic Preserving Translations. Math. Syst. Theory 8(2): 105-126 (1975) - 1974
- [j4]David B. Benson:
An Abstract Machine Theory for Formal Language Parsers. Acta Informatica 3: 187-202 (1974) - [c3]David B. Benson:
An abstract machine theory for formal language parsers. Category Theory Applied to Computation and Control 1974: 106-111 - 1973
- [j3]David B. Benson:
Another comment on the null word definition problem. SIGACT News 5(1): 14-17 (1973) - [j2]David B. Benson:
An alternate proof of Aho & Ullman's LR(k) viable prefix theorem. SIGACT News 5(4): 11-14 (1973) - 1970
- [j1]David B. Benson:
Syntax and Semantics: A Categorical View. Inf. Control. 17(2): 145-160 (1970) - [c2]David B. Benson:
Syntactic Clues. SWAT 1970: 133-138
1960 – 1969
- 1969
- [c1]David B. Benson:
The algebra of derivations and a semithue parser. ACM National Conference 1969: 1-9
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
