Demo Data from EDBT 2026 / reviewers in the wild / expert
Vitaly O. Mordan
dblp:181/9833
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2016
0000-0002-3277-1964ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1
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 |
Program verification · 100% | |
| Theoretical computer science
1 paper |
Automated reasoning and model checking · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program verification › model checking
software model checking |
0.2 | 1 | 2016 | On-the-fly decomposition of specifications in software model checking · SIGSOFT FSE 2016 |
Automated reasoning and model checking › model checking
state space explosion |
0.1 | 1 | 2016 | On-the-fly decomposition of specifications in software model checking · SIGSOFT FSE 2016 |
Methods — techniques the papers use, named apart from their topics
property weaving · 0.5on-the-fly decomposition · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | On-the-fly decomposition of specifications in software model checkingabstractMajor breakthroughs have increased the efficiency and effectiveness of software model checking considerably, such that this technology is now applicable to industrial-scale software. However, verifying the full formal specification of a software system is still considered too complex, and in practice, sets of properties are verified one by one in isolation. We propose an approach that takes the full formal specification as input and first tries to verify all properties simultaneously in one verification run. Our verification algorithm monitors itself and detects situations for which the full set of properties is too complex. In such cases, we perform an automatic decomposition of the full set of properties into smaller sets, and continue the verification seamlessly. To avoid state-space explosion for large sets of properties, we introduce on-the-fly property weaving: properties get weaved into the program's transition system on the fly, during the analysis; which properties to weave and verify is determined dynamically during the verification process. We perform an extensive evaluation based on verification tasks that were derived from 4336 Linux kernel modules, and a set of properties that define the correct usage of the Linux API. Checking several properties simultaneously can lead to a significant performance gain, due to the fact that abstract models share many parts among different properties. Sven Apel, Dirk Beyer 0001, Vitaly O. Mordan, Vadim S. Mutilin, Andreas Stahlbauer |
SIGSOFT FSE | 3 |