Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

David Kaindlstorfer

dblp:393/9249 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2024
0009-0008-4137-5163ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 1 first-author · 2 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
2 papers
Program analysis · 70% Software testing · 23% Programming languages and type systems · 7%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program analysis
static analysis
0.812024
Constraint-Based Test Oracles for Program Analyzers · ASE 2024
Program analysis › static analysis
static analyzer testing
0.812024
Interrogation Testing of Program Analyzers for Soundness and Precision Issues · ASE 2024
Software testing
test oracle
0.812024
Constraint-Based Test Oracles for Program Analyzers · ASE 2024
Programming languages and type systems › type systems
soundness
0.212024
Constraint-Based Test Oracles for Program Analyzers · ASE 2024

Methods — techniques the papers use, named apart from their topics

specification-based testing · 0.8metamorphic testing · 0.8differential testing · 0.8constraint solving · 0.8
YearPublicationVenuePosition
2024 Constraint-Based Test Oracles for Program Analyzers
abstract
Program analyzers implement complex algorithms and, as any software, can contain bugs. Bugs in their implementation may lead to analyzers being imprecise and failing to verify safe programs, i.e., programs with no reachable error locations; or worse, analyzer bugs may lead to reporting unsound results by verifying unsafe programs, i.e., programs with reachable error locations.
Markus Fleischmann, David Kaindlstorfer, Anastasia Isychev, Valentin Wüstholz, Maria Christakis
ASE2
2024 Interrogation Testing of Program Analyzers for Soundness and Precision Issues
abstract
Program analyzers are critical in safeguarding software reliability. However, due to their inherent complexity, they are likely to contain bugs themselves, and the question of how to detect them arises. Existing approaches, primarily based on specification-based, differential, or metamorphic testing, have been successful in finding analyzer bugs, but also come with certain limitations.
David Kaindlstorfer, Anastasia Isychev, Valentin Wüstholz, Maria Christakis
ASE1