Demo Data from SIGIR 2026 / reviewers in the wild / expert
Anton Opaterny
dblp:352/2291
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0002-8124-6197ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1 · 1 since 2021Theory of computation · 1 · 1 since 2021
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.
| Software engineering, system software, and programming languages
1 paper |
Concurrent programming · 50% Program verification · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Concurrent programming › atomicity
linearizability |
0.7 | 1 | 2023 | nekton: A Linearizability Proof Checker · CAV (1) 2023 |
Program verification › mechanized verification
proof checking |
0.7 | 1 | 2023 | nekton: A Linearizability Proof Checker · CAV (1) 2023 |
Methods — techniques the papers use, named apart from their topics
separation logic · 0.7hindsight arguments · 0.7flow framework · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | nekton: A Linearizability Proof CheckerabstractAbstract is a new tool for checking linearizability proofs of highly complex concurrent search structures. The tool’s unique features are its parametric heap abstraction based on separation logic and the flow framework, and its support for hindsight arguments about future-dependent linearization points. We describe the tool, present a case study, and discuss implementation details. Roland Meyer 0001, Anton Opaterny, Thomas Wies, Sebastian Wolff 0001 |
CAV (1) | 2 |