David Hopkins 0002

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

dblp:63/5147-2 · DBLP profile ↗

← Back

4ranked-venue papers

3as first author

0since 2021 · last 2015

—ORCID · none

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

Theory of computation · 4 · 3 first-authorSoftware engineering, systems software and programming languages · 3 · 2 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 3 papers		Automata and formal languages · 79% Logic in computer science · 21%
Software engineering, system software, and programming languages 3 papers		Programming languages and type systems · 100%

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

Topic	Weight	Papers	Last	Evidence papers
Programming languages and type systems › functional language ML	0.3	2	2012	Hector: An Equivalence Checker for a Higher-Order Fragment of ML · CAV 2012 A Fragment of ML Decidable by Visibly Pushdown Automata · ICALP (2) 2011
Automata and formal languages equivalence problem	0.2	2	2012	Hector: An Equivalence Checker for a Higher-Order Fragment of ML · CAV 2012 Homer: A Higher-Order Observational Equivalence Model checkER · CAV 2009
Programming languages and type systems higher-order languages	0.2	2	2012	Hector: An Equivalence Checker for a Higher-Order Fragment of ML · CAV 2012 Homer: A Higher-Order Observational Equivalence Model checkER · CAV 2009
Automata and formal languages › pushdown automata visibly pushdown automata	0.1	1	2011	A Fragment of ML Decidable by Visibly Pushdown Automata · ICALP (2) 2011
Logic in computer science › process algebra observational equivalence	0.1	1	2009	Homer: A Higher-Order Observational Equivalence Model checkER · CAV 2009

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

equivalence checking · 0.3model checking · 0.2

Year	Publication	Venue	Position
2015	Fragments of ML Decidable by Nested Data Class Memory Automata Conrad Cotton-Barratt, David Hopkins 0002, Andrzej S. Murawski, C.-H. Luke Ong	FoSSaCS	2
2012	Hector: An Equivalence Checker for a Higher-Order Fragment of ML David Hopkins 0002, Andrzej S. Murawski, C.-H. Luke Ong	CAV	1
2011	A Fragment of ML Decidable by Visibly Pushdown Automata David Hopkins 0002, Andrzej S. Murawski, C.-H. Luke Ong	ICALP (2)	1
2009	Homer: A Higher-Order Observational Equivalence Model checkER David Hopkins 0002, C.-H. Luke Ong	CAV	1