Sound and quasi-complete detection of infeasible test requirements

Abstract : In software testing, coverage criteria specify the requirements to be covered by the test cases. However, in practice such criteria are limited due to the well-known infeasibility problem, which concerns elements/requirements that cannot be covered by any test case. To deal with this issue we revisit and improve state-of-the-art static analysis techniques, such as Value Analysis and Weakest Precondition calculus. We propose a lightweight greybox scheme for combining these two techniques in a complementary way. In particular we focus on detecting infeasible test requirements in an automatic and sound way for condition coverage, multiple condition coverage and weak mutation testing criteria. Experimental results show that our method is capable of detecting almost all the infeasible test requirements, 95% on average, in a reasonable amount of time, i.e., less than 40 seconds, making it practical for unit testing.
Document type :
Conference papers
Complete list of metadatas

https://hal-cea.archives-ouvertes.fr/cea-01836560
Contributor : Léna Le Roy <>
Submitted on : Thursday, July 12, 2018 - 1:53:51 PM
Last modification on : Wednesday, January 23, 2019 - 2:39:33 PM

Links full text

Identifiers

Citation

Sebastien Bardin, Mickael Delahaye, Robin David, Nikolai Kosmatov, Mike Papadakis, et al.. Sound and quasi-complete detection of infeasible test requirements. ICST 2015 - IEEE 8th International Conference on Software Testing, Verification and Validation, Apr 2015, Graz, Austria. pp.1-10, ⟨10.1109/ICST.2015.7102607⟩. ⟨cea-01836560⟩

Share

Metrics

Record views

140