Alexander Horton

dblp:02/10045 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · unresolved

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
Software testing · 54% Program verification · 23% Program analysis · 23%

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

TopicWeightPapersLastEvidence papers
Program verification › annotation inference
contract inference
0.112011
Stateful testing: Finding more errors in code and contracts · ASE 2011
Program analysis › specification mining
dynamic invariant detection
0.112011
Stateful testing: Finding more errors in code and contracts · ASE 2011
Software testing › model-based testing
finite state machine testing
0.112011
Stateful testing: Finding more errors in code and contracts · ASE 2011
Software testing
random testing
0.112011
Stateful testing: Finding more errors in code and contracts · ASE 2011
Software testing
test generation
0.012011
Stateful testing: Finding more errors in code and contracts · ASE 2011

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

random testing · 0.1dynamic invariant inference · 0.1
YearPublicationVenuePosition
2011 Stateful testing: Finding more errors in code and contracts
abstract
Automated random testing has shown to be an effective approach to finding faults but still faces a major unsolved issue: how to generate test inputs diverse enough to find many faults and find them quickly. Stateful testing, the automated testing technique introduced in this article, generates new test cases that improve an existing test suite. The generated test cases are designed to violate the dynamically inferred contracts (invariants) characterizing the existing test suite. As a consequence, they are in a good position to detect new faults, and also to improve the accuracy of the inferred contracts by discovering those that are unsound. Experiments on 13 data structure classes totalling over 28,000 lines of code demonstrate the effectiveness of stateful testing in improving over the results of long sessions of random testing: stateful testing found 68.4% new faults and improved the accuracy of automatically inferred contracts to over 99%, with just a 7% time overhead.
Yi Wei 0001, Hannes Roth, Carlo A. Furia, Yu Pei 0001, Alexander Horton, Michael Steindorfer, Martín Nordio, Bertrand Meyer 0001
ASE5