Journal
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
Volume 36, Issue 3, Pages 309-322Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TSE.2010.30
Keywords
Software/program verification; testing and debugging; software engineering.
Funding
- US National Science Foundation (NSF) [CCF-0438786, CCF-0724979, IIS-0438967, CCF-0702680, CCF-0845628]
- US Air Force Office of Scientific Research [FA9550-09-1-0351]
- Direct For Computer & Info Scie & Enginr
- Division of Computing and Communication Foundations [0845628] Funding Source: National Science Foundation
Ask authors/readers for more resources
Recent advances in mechanical techniques for systematic testing have increased our ability to automatically find subtle bugs, and hence, to deploy more dependable software. This paper builds on one such systematic technique, scope-bounded testing, to develop a novel specification-based approach for efficiently generating tests for products in a software product line. Given properties of features as first-order logic formulas in Alloy, our approach uses SAT-based analysis to automatically generate test inputs for each product in a product line. To ensure soundness of generation, we introduce an automatic technique for mapping a formula that specifies a feature into a transformation that defines incremental refinement of test suites. Our experimental results using different data structure product lines show that an incremental approach can provide an order of magnitude speedup over conventional techniques. We also present a further optimization using dedicated integer constraint solvers for feature properties that introduce integer constraints, and show how to use a combination of solvers in tandem for solving Alloy formulas.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available