Demo Data from EDBT 2026 / reviewers in the wild / expert
René Neumann
dblp:88/11065
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 2Theory of computation · 2
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 · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Program verification · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automated reasoning and model checking › model checking › temporal logic model checking
LTL model checking |
0.2 | 1 | 2013 | A Fully Verified Executable LTL Model Checker · CAV 2013 |
Automated reasoning and model checking
model checking |
0.2 | 1 | 2013 | A Fully Verified Executable LTL Model Checker · CAV 2013 |
Methods — techniques the papers use, named apart from their topics
formal verification · 0.3executable model checking · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | A Framework for Verifying Depth-First Search AlgorithmsabstractMany graph algorithms are based on depth-first search (DFS). The formalizations of such algorithms typically share many common ideas. In this paper, we summarize these ideas into a framework in Isabelle/HOL. Peter Lammich, René Neumann |
CPP | 2 |
| 2013 | A Fully Verified Executable LTL Model Checker
Javier Esparza, Peter Lammich, René Neumann, Tobias Nipkow, Alexander Schimpf, Jan-Georg Smaus |
CAV | 3 |