Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Robert S. Streett

dblp:48/6247 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 1989
—ORCID · none

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

Theory of computation · 5 · 4 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
5 papers
Logic in computer science · 76% Automated reasoning and model checking · 18% Computational complexity · 6%

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

TopicWeightPapersLastEvidence papers
Logic in computer science
modal logic		 0.041989
An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus · Inf. Comput. 1989
Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable · Inf. Control. 1982
Propositional Dynamic Logic of Looping and Converse · STOC 1981
Logic in computer science › modal logic › multi-modal logic
modal mu-calculus		 0.021989
An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus · Inf. Comput. 1989
The Propositional Mu-Calculus is Elementary · ICALP 1984
Logic in computer science › modal logic › dynamic logic
propositional dynamic logic		 0.031982
Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable · Inf. Control. 1982
Propositional Dynamic Logic of Looping and Converse · STOC 1981
The Deducibility Problem in Propositional Dynamic Logic · ICALP 1981
Automated reasoning and model checking
decision procedures		 0.011989
An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus · Inf. Comput. 1989
Logic in computer science › modal logic
dynamic logic		 0.021982
Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable · Inf. Control. 1982
Propositional Dynamic Logic of Looping and Converse · STOC 1981
Computational complexity
decidability		 0.011981
The Deducibility Problem in Propositional Dynamic Logic · ICALP 1981
Automated reasoning and model checking › theorem proving
deducibility problem		 0.011981
The Deducibility Problem in Propositional Dynamic Logic · ICALP 1981
Logic in computer science
program semantics		 0.011981
Propositional Dynamic Logic of Looping and Converse · STOC 1981
Computational complexity › implicit computational complexity
elementary complexity		 0.011984
The Propositional Mu-Calculus is Elementary · ICALP 1984

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

relational semantics · 0.0
YearPublicationVenuePosition
1989 An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus
Robert S. Streett, E. Allen Emerson
 Inf. Comput.1
1984 The Propositional Mu-Calculus is Elementary
Robert S. Streett, E. Allen Emerson
 ICALP1
1982 Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable
Robert S. Streett
 Inf. Control.1
1981 The Deducibility Problem in Propositional Dynamic Logic
Albert R. Meyer, Robert S. Streett, Grazyna Mirkowska
 ICALP2
1981 Propositional Dynamic Logic of Looping and Converse
abstract
Dynamic logic [5,6,15,16] applies concepts from modal logic to a relational semantics of programs to yield various systems for reasoning about the before-after behavior of programs. Analogues to the modal logic assertions ?p (possibly p) and ?p(necessarily p) are the dynamic logic constructs p and [a]p. If a is a program and p is an assertion about the state of a computation, then ,p asserts that after executing a, p can be the case, and [a]p asserts that after executing a, p must be the case.
Robert S. Streett
 STOC1