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

Eyal Harel

dblp:93/1286 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1990
—ORCID · none

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

Theory of computation · 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
1 paper
Automated reasoning and model checking · 67% Logic in computer science · 33%

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

TopicWeightPapersLastEvidence papers
Automated reasoning and model checking
decision procedures		 0.011990
Explicit Clock Temporal Logic · LICS 1990
Automated reasoning and model checking
model checking		 0.011990
Explicit Clock Temporal Logic · LICS 1990
Automated reasoning and model checking › model checking
real-time model checking		 0.011990
Explicit Clock Temporal Logic · LICS 1990
Logic in computer science › temporal logic
real-time temporal logic		 0.011990
Explicit Clock Temporal Logic · LICS 1990
Logic in computer science
temporal logic		 0.011990
Explicit Clock Temporal Logic · LICS 1990
Automated reasoning and model checking › automated reasoning
validity problem		 0.011990
Explicit Clock Temporal Logic · LICS 1990

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

expressive power comparison · 0.0
YearPublicationVenuePosition
1990 Explicit Clock Temporal Logic
abstract
The authors present a single exponent decision procedure for the validity of XCTL formulas, and a double exponent decision procedure for the validity of XCTL formulas over finite state programs (model checking). The expressive power of XCTL is compared with that of some other logics proposed for the expression of real time properties. It is shown that it is incomparable with the expressive power of the recently proposed logic TPTL (timed propositional temporal logic).>
Eyal Harel, Orna Lichtenstein, Amir Pnueli
 LICS1