AUSTIN: A Tool for Search Based Software Testing for the C Language and Its Evaluation on Deployed Automotive Systems

Authors:
Kiran Lakhotia;Mark Harman;Hamilton Gross
Affiliations:
-;-;-
Venue:
SSBSE '10 Proceedings of the 2nd International Symposium on Search Based Software Engineering
Year:
2010

Citing 0
Cited 6

Automatically performing weak mutation with the aid of symbolic execution, concolic testing and search-based testing

Software Quality Control
Dynamic adaptive search based software engineering

Proceedings of the ACM-IEEE international symposium on Empirical software engineering and measurement
AUSTIN: An open source tool for search based software testing of C programs

Information and Software Technology
Software engineering: an ideal set of challenges for evolutionary computation

Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Cloud engineering is Search Based Software Engineering too

Journal of Systems and Software
Dynamic stopping criteria for search-based test data generation for path testing

Information and Software Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Despite the large number of publications on Search--Based Software Testing (SBST), there remain few publicly available tools. This paper introduces AUSTIN, a publicly available SBST tool for the C language. The paper validates the tool with an empirical study of its effectiveness and efficiency in achieving branch coverage compared to random testing and the Evolutionary Testing Framework (ETF), which is used in-house by Daimler and others for Evolutionary Testing. The programs used in the study consist of eight non--trivial, real-world C functions drawn from three embedded automotive software modules. For the majority of the functions, AUSTIN is at least as effective (in terms of achieved branch coverage) as the ETF, and is considerably more efficient.