Demo Data from VLDB 2026 / reviewers in the wild / expert
Andrew Luka
dblp:408/6658
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0007-9369-859XORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author · 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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Electronic design automation · 100% | |
| Theoretical computer science
1 paper |
Automated reasoning and model checking · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation › hardware verification and test
hardware verification |
0.9 | 1 | 2025 | Property Directed Reachability with Extended Resolution · CAV (1) 2025 |
Electronic design automation
model checking |
0.9 | 1 | 2025 | Property Directed Reachability with Extended Resolution · CAV (1) 2025 |
Automated reasoning and model checking › resolution-based reasoning
extended resolution |
0.9 | 1 | 2025 | Property Directed Reachability with Extended Resolution · CAV (1) 2025 |
Automated reasoning and model checking › model checking
property directed reachability |
0.9 | 1 | 2025 | Property Directed Reachability with Extended Resolution · CAV (1) 2025 |
Methods — techniques the papers use, named apart from their topics
extended resolution · 1.7PDR · 1.7IC3 · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Property Directed Reachability with Extended ResolutionabstractAbstract Property Directed Reachability ( Pdr ), also known as IC3, is a state-of-the-art model checking algorithm widely used for verifying safety properties. While Pdr is effective in finding inductive invariants, its underlying proof system, Resolution, limits its ability to construct short proofs for certain verification problems. This paper introduces PdrER , a novel generalization of Pdr that uses Extended Resolution (ER), a proof system exponentially stronger than Resolution, when constructing a proof of correctness. PdrER leverages ER to construct shorter bounded proofs of correctness, enabling it to discover more compact inductive invariants. While PdrER is based on Pdr , it includes algorithmic enhancements that had to be made in order to efficiently use ER in the context of model checking. We implemented PdrER in a new open-source verification framework and evaluated it on the Hardware Model Checking Competition benchmarks from 2019, 2020 and 2024. Our experimental evaluation demonstrates that PdrER outperforms Pdr , solving more instances in less time and uniquely solving problems that Pdr cannot solve within a given time limit. We argue that this paper represents a significant step toward making strong proof systems practically usable in model checking. Andrew Luka, Yakir Vizel |
CAV (1) | 1 |