David B. Benson

dblp:23/922 · DBLP profile ↗
← Back
22ranked-venue papers
15as first author
0since 2021 · last 1990
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 18 · 12 first-authorArtificial intelligence and machine learning · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
7 papers
Logic in computer science · 49% Automata and formal languages · 24% Computational complexity · 23%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%
Artificial intelligence
1 paper
Planning, search and constraint satisfaction · 100%

Topics — the 15 heaviest of 18, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science
program semantics
0.021984
Counting Paths: Nondeterminism as Linear Algebra · IEEE Trans. Software Eng. 1984
Functional Behvior of Nondeterministic and Concurrent Programs · Inf. Control. 1984
Logic in computer science
bisimulation
0.011988
Bisimulation of Automata · Inf. Comput. 1988
Computational complexity
nondeterminism
0.011984
Counting Paths: Nondeterminism as Linear Algebra · IEEE Trans. Software Eng. 1984
Computational complexity › counting problems
path counting
0.011984
Counting Paths: Nondeterminism as Linear Algebra · IEEE Trans. Software Eng. 1984
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
game tree search
0.011979
Tree Analysis Techniques in Tsumego · IJCAI 1979
Compilers and program optimization › parsing
LR(k) parsers
0.011977
Parallel Decomposition of LR(k) Parsers (Extended Abstract) · ICALP 1977
Compilers and program optimization
parsing
0.011977
Parallel Decomposition of LR(k) Parsers (Extended Abstract) · ICALP 1977
Automata and formal languages › formal grammars
context-free grammar
0.011977
Some Preservation Properties of Normal Form Grammars · SIAM J. Comput. 1977
Automata and formal languages
formal grammars
0.011977
Some Preservation Properties of Normal Form Grammars · SIAM J. Comput. 1977
Logic in computer science
proof theory
0.011975
The Basic Algebraic Structures in Categories of Derivations · Inf. Control. 1975
Games and playful interaction
board games
0.011979
Tree Analysis Techniques in Tsumego · IJCAI 1979
Logic in computer science
categorical semantics
0.011970
Syntax and Semantics: A Categorical View · Inf. Control. 1970
Logic in computer science
semantics
0.011970
Syntax and Semantics: A Categorical View · Inf. Control. 1970
Parallel and multicore computing
parallel algorithms
0.011977
Parallel Decomposition of LR(k) Parsers (Extended Abstract) · ICALP 1977
Coding theory
algebraic structure
0.011975
The Basic Algebraic Structures in Categories of Derivations · Inf. Control. 1975

Methods — techniques the papers use, named apart from their topics

bisimulation · 0.0matrix multiplication · 0.0linear algebra · 0.0tree analysis · 0.0parser decomposition · 0.0structural analysis · 0.0adjunction · 0.0
YearPublicationVenuePosition
1990 Fixed Points in Free Process Algebras, Part II
Jerzy Tiuryn, David B. Benson
Theor. Comput. Sci.2
1989 Fixed Points in Free Process Algebras, Part I
David B. Benson, Jerzy Tiuryn
Theor. Comput. Sci.1
1988 Bisimulation of Automata
David B. Benson, Ofer Ben-Shachar
Inf. Comput.1
1987 Algebraic Solutions to Recursion Schemes
David B. Benson, Irène Guessarian
J. Comput. Syst. Sci.1
1986 Strong Bisimulation of State Automata
David B. Benson, Ofer Ben-Shachar
LICS1
1985 Free Semiring-Representations and Nondeterminism
Michael G. Main, David B. Benson
J. Comput. Syst. Sci.2
1984 Functional Behvior of Nondeterministic and Concurrent Programs
Michael G. Main, David B. Benson
Inf. Control.2
1984 Counting Paths: Nondeterminism as Linear Algebra
abstract
Nondeterminism is considered to be ignorance about the actual state transition sequence performed during a computation. The number of distinct potential paths from state i to j forms a matrix [nij]. The behavior of a nondeterministic program is defined to be this multiplicity matrix of the state transitions. The standard programming constructs have behaviors defined in terms of the behaviors of their constituents using matrix addition and multiplication only. The spectral radius of the matrix assigned to an iterating component characterizes its convergence. The spectral radius is shown to be either 0 or else ⩾ 1. The program converges iff the spectral radius is zero, diverges deterministically iff the spectral radius is one, and has a proper nondeterministic divergence iff the spectral radius exceeds one. If the machine has an infinite number of states the characterization of convergence is given graph theoretically. The spectral radii of synchronous and interleaved parallel noncommunicating systems are easily computed in terms of the spectral radii of the components.
David B. Benson
IEEE Trans. Software Eng.1
1983 Functional Behaviour of Nondeterministic Programs
Michael G. Main, David B. Benson
FCT2
1983 Denotational Semantics for "Natural" Language Question-Answering Programs
Michael G. Main, David B. Benson
Am. J. Comput. Linguistics2
1983 Deterministic and Nondeterministic Flowchart Interpretations
Richard J. Lorentz, David B. Benson
J. Comput. Syst. Sci.2
1982 In Scott-Strachey Style Denotational Semantics, Parallelism Implies Nondeterminism
David B. Benson
Math. Syst. Theory1
1981 Free Upper Regular Bands
Michael G. Main, David B. Benson
Theor. Comput. Sci.2
1979 Tree Analysis Techniques in Tsumego
David B. Benson, Bruce R. Hilditch, J. Denbigh Starkey
IJCAI1
1979 Parameter Passing in Nondeterministic Recursive Programs
David B. Benson
J. Comput. Syst. Sci.1
1977 Parallel Decomposition of LR(k) Parsers (Extended Abstract)
David B. Benson, Ralph D. Jeffords
ICALP1
1977 Some Preservation Properties of Normal Form Grammars
abstract
The normal form grammars, such as those developed by Chomsky and Greibach, preserve certain properties of the original grammar. Ordinarily attention is only directed to weak equivalence, that is, that the original grammar and its normal form version both generate the same language. By paying greater attention to the functions carrying a grammar to its normal form, considerably stronger preservation properties can be proved. We demonstrate that several normal forms preserve ambiguities. More surprisingly, a variant of Chomsky’s normal form, called canonical two form, forms an adjunction in connection with the original grammar. This fact shows that canonical two form preserves a large number of the structural properties of the original grammar. In particular, we show that the canonical two form is $LR(k)$ if the original grammar is $LR(k)$, strengthening a result of Gray and Harrison. Preservation of structural properties such as ambiguity is important in semantic considerations, and the methods given for the determination of property preservation seem to be of general applicability.
David B. Benson
SIAM J. Comput.1
1976 Life in the game of Go
David B. Benson
Inf. Sci.1
1975 The Basic Algebraic Structures in Categories of Derivations
David B. Benson
Inf. Control.1
1975 Semantic Preserving Translations
David B. Benson
Math. Syst. Theory1
1974 An Abstract Machine Theory for Formal Language Parsers
David B. Benson
Acta Informatica1
1970 Syntax and Semantics: A Categorical View
David B. Benson
Inf. Control.1