Demo Data from EDBT 2026 / reviewers in the wild / expert
Anemone Kampkötter
dblp:380/9438
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0003-4286-714XORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 2 · 2 since 2021Databases, data management, data science and information retrieval · 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 |
Program analysis · 83% Software testing · 17% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program analysis › static analysis › interprocedural analysis
call graph analysis |
0.8 | 1 | 2024 | Total Recall? How Good Are Static Call Graphs Really? · ISSTA 2024 |
Program analysis › static analysis
call graph construction |
0.8 | 1 | 2024 | Total Recall? How Good Are Static Call Graphs Really? · ISSTA 2024 |
Program analysis
static analysis |
0.8 | 1 | 2024 | Total Recall? How Good Are Static Call Graphs Really? · ISSTA 2024 |
Software testing › fuzzing
coverage-guided fuzzing |
0.2 | 1 | 2024 | Total Recall? How Good Are Static Call Graphs Really? · ISSTA 2024 |
Software testing
fuzzing |
0.2 | 1 | 2024 | Total Recall? How Good Are Static Call Graphs Really? · ISSTA 2024 |
Methods — techniques the papers use, named apart from their topics
manual extension · 0.8dynamic baseline · 0.8coverage-guided fuzzing · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | CoPhi - Mining C/C++ Packages for Conan Ecosystem AnalysisabstractLarge-scale analyses of software ecosystems allow researchers to identify widespread vulnerabilities, validate dependencies for safe usage, and gain an understanding of the conditions of software package landscapes. In the C/C++ ecosystem however, there are many challenges facing large-scale analyses, due to the lack of a standard package manager or build system. With this work, we aim to explore the Conan ecosystem by statically analyzing it as a whole and on a large scale. We provide a static analysis tool set named CoPhi that crawls Conan packages and analyzes them for specific features to capture C/C++ ecosystem metrics of interest, and also create corpora with user-defined properties. In a case study, we demonstrate the effectiveness of CoPhi by analyzing 620 Conan packages for four different metrics. Vivek Sarkar, Anemone Kampkötter, Ben Hermann |
MSR | 2 |
| 2024 | Total Recall? How Good Are Static Call Graphs Really?abstractStatic call graphs are a fundamental building block of program analysis. However, differences in call-graph construction and the use of specific language features can yield unsoundness and imprecision. Call-graph analyses are evaluated using measures of precision and recall, but this is hard when a ground truth for real-world programs is generally unobtainable. In this work, we propose to use carefully constructed dynamic baselines based on fixed entry points and input corpora. The creation of this dynamic baseline is posed as an approximation of the ground truth---an optimization problem. We use manual extension and coverage-guided fuzzing for creating suitable input corpora. With these dynamic baselines, we study call-graph quality of multiple algorithms and implementations using four real-world Java programs. We find that our methodology provides valuable insights into call-graph quality and how to measure it. With this work, we provide a novel methodology to advance the field of static program analysis as we assess the computation of one of its core data structures---the call graph. Dominik Helm, Sven Keidel, Anemone Kampkötter, Johannes Düsing, Tobias Roth, Ben Hermann, Mira Mezini |
ISSTA | 3 |