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

Christoph Mallon

dblp:20/7915 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

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

Software engineering, systems software and programming languages · 4Security and privacy · 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
2 papers
Program analysis · 54% Software testing · 46%

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

TopicWeightPapersLastEvidence papers
Software testing
test generation
0.322012
Automatically Generating Test Cases for Specification Mining · IEEE Trans. Software Eng. 2012
Generating test cases for specification mining · ISSTA 2010
Program analysis › specification mining
dynamic specification mining
0.112012
Automatically Generating Test Cases for Specification Mining · IEEE Trans. Software Eng. 2012
Program analysis
specification mining
0.112010
Generating test cases for specification mining · ISSTA 2010
Program analysis › type-based analysis
typestate analysis
0.012012
Automatically Generating Test Cases for Specification Mining · IEEE Trans. Software Eng. 2012

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

systematic test case generation · 0.1typestate verification · 0.1dynamic specification mining · 0.1
YearPublicationVenuePosition
2017 Benchmarking Static Code Analyzers
Jörg Herter, Daniel Kästner, Christoph Mallon, Reinhard Wilhelm
SAFECOMP3
2013 Simple and Efficient Construction of Static Single Assignment Form
abstract
We present a simple SSA construction algorithm, which allows direct translation from an abstract syntax tree or bytecode into an SSA-based intermediate representation. The algorithm requires no prior analysis and ensures that even during construction the intermediate representation is in SSA form. This allows the application of SSA-based optimizations during construction. After completion, the intermediate representation is in minimal and pruned SSA form. In spite of its simplicity, the runtime of our algorithm is on par with Cytron et al.’s algorithm. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Matthias Braun 0003, Sebastian Buchwald, Sebastian Hack, Roland Leißa, Christoph Mallon, Andreas Zwinkau
CC5
2012 Automatically Generating Test Cases for Specification Mining
abstract
Dynamic specification mining observes program executions to infer models of normal program behavior. What makes us believe that we have seen sufficiently many executions? The TAUTOKO (“Tautoko” is the Mãori word for “enhance, enrich.”) typestate miner generates test cases that cover previously unobserved behavior, systematically extending the execution space, and enriching the specification. To our knowledge, this is the first combination of systematic test case generation and typestate mining-a combination with clear benefits: On a sample of 800 defects seeded into six Java subjects, a static typestate verifier fed with enriched models would report significantly more true positives and significantly fewer false positives than the initial models.
Valentin Dallmeier, Nikolai Knopp, Christoph Mallon, Gordon Fraser 0001, Sebastian Hack, Andreas Zeller
IEEE Trans. Software Eng.3
2010 Preference-Guided Register Assignment
Matthias Braun 0003, Christoph Mallon, Sebastian Hack
CC2
2010 Generating test cases for specification mining
abstract
Dynamic specification mining observes program executions to infer models of normal program behavior. What makes us believe that we have seen sufficiently many executions? The TAUTOKO 1 typestate miner generates test cases that cover previously unobserved behavior, systematically extending the execution space and enriching the specification. To our knowledge, this is the first combination of systematic test case generation and specification mining–a combination with clear benefits: On a sample of 800 defects seeded into six Java subjects, a static typestate verifier fed with enriched models would report significantly more true positives, and significantly less false positives than the initial models.
Valentin Dallmeier, Nikolai Knopp, Christoph Mallon, Sebastian Hack, Andreas Zeller
ISSTA3