Demo Data from EDBT 2026 / reviewers in the wild / expert
Stefan Löwe
dblp:72/11109
· DBLP profile ↗
12ranked-venue papers
4as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 12 · 4 first-author · 1 since 2021Computer networks · 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% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program verification › equivalence checking
regression verification |
0.2 | 1 | 2013 | Precision reuse for efficient regression verification · ESEC/SIGSOFT FSE 2013 |
Program verification › model checking
software model checking |
0.2 | 1 | 2013 | Precision reuse for efficient regression verification · ESEC/SIGSOFT FSE 2013 |
Methods — techniques the papers use, named apart from their topics
predicate abstraction · 0.2abstract interpretation · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Correction to: Reliable benchmarking: requirements and solutionsabstractThe article Reliable benchmarking: requirements and solutions. Dirk Beyer 0001, Stefan Löwe, Philipp Wendler |
Int. J. Softw. Tools Technol. Transf. | 2 |
| 2019 | Reliable benchmarking: requirements and solutionsabstractAbstract Benchmarking is a widely used method in experimental computer science, in particular, for the comparative evaluation of tools and algorithms. As a consequence, a number of questions need to be answered in order to ensure proper benchmarking, resource measurement, and presentation of results, all of which is essential for researchers, tool developers, and users, as well as for tool competitions. We identify a set of requirements that are indispensable for reliable benchmarking and resource measurement of time and memory usage of automatic solvers, verifiers, and similar tools, and discuss limitations of existing methods and benchmarking tools. Fulfilling these requirements in a benchmarking framework can (on Linux systems) currently only be done by using the cgroup and namespace features of the kernel. We developed BenchExec , a ready-to-use, tool-independent, and open-source implementation of a benchmarking framework that fulfills all presented requirements, making reliable benchmarking and resource measurement easy. Our framework is able to work with a wide range of different tools, has proven its reliability and usefulness in the International Competition on Software Verification, and is used by several research groups worldwide to ensure reliable benchmarking. Finally, we present guidelines on how to present measurement results in a scientifically valid and comprehensible way. Dirk Beyer 0001, Stefan Löwe, Philipp Wendler |
Int. J. Softw. Tools Technol. Transf. | 2 |
| 2016 | CPA-RefSel: CPAchecker with Refinement Selection - (Competition Contribution)
Stefan Löwe |
TACAS | 1 |
| 2015 | Sliced Path Prefixes: An Effective Method to Enable Refinement Selection
Dirk Beyer 0001, Stefan Löwe, Philipp Wendler |
FORTE | 2 |
| 2015 | Refinement Selection
Dirk Beyer 0001, Stefan Löwe, Philipp Wendler |
SPIN | 2 |
| 2015 | Benchmarking and Resource Measurement
Dirk Beyer 0001, Stefan Löwe, Philipp Wendler |
SPIN | 2 |
| 2015 | CPAchecker with Support for Recursive Programs and Floating-Point Arithmetic - (Competition Contribution)
Matthias Dangl, Stefan Löwe, Philipp Wendler |
TACAS | 2 |
| 2014 | CPAchecker with Sequential Combination of Explicit-Value Analyses and Predicate Analyses - (Competition Contribution)
Stefan Löwe, Mikhail U. Mandrykin, Philipp Wendler |
TACAS | 1 |
| 2013 | Explicit-State Software Model Checking Based on CEGAR and Interpolation
Dirk Beyer 0001, Stefan Löwe |
FASE | 2 |
| 2013 | Precision reuse for efficient regression verificationabstractContinuous testing during development is a well-established technique for software-quality assurance. Continuous model checking from revision to revision is not yet established as a standard practice, because the enormous resource consumption makes its application impractical. Model checkers compute a large number of verification facts that are necessary for verifying if a given specification holds. We have identified a category of such intermediate results that are easy to store and efficient to reuse: abstraction precisions. The precision of an abstract domain specifies the level of abstraction that the analysis works on. Precisions are thus a precious result of the verification effort and it is a waste of resources to throw them away after each verification run. In particular, precisions are reasonably small and thus easy to store; they are easy to process and have a large impact on resource consumption. We experimentally show the impact of precision reuse on industrial verification problems created from 62 Linux kernel device drivers with 1119 revisions. Dirk Beyer 0001, Stefan Löwe, Evgeny Novikov, Andreas Stahlbauer, Philipp Wendler |
ESEC/SIGSOFT FSE | 2 |
| 2013 | CPAchecker with Explicit-Value Analysis Based on CEGAR and Interpolation - (Competition Contribution)
Stefan Löwe |
TACAS | 1 |
| 2012 | CPAchecker with Adjustable Predicate Analysis - (Competition Contribution)
Stefan Löwe, Philipp Wendler |
TACAS | 1 |