Assertion Inferring Mutants
Aayush Garg, Renzo Degiovanni, Facundo Molina, Mike Papadakis,, Nazareno Aguirre, Maxime Cordy, Yves Le Traon

TL;DR
This paper introduces AIMS, a learning-based method to select a small, effective subset of mutants for assertion inference, significantly reducing computational costs while maintaining high inference accuracy.
Contribution
AIMS is the first approach to statically approximate assertion-inferable mutants, enabling scalable assertion inference with minimal loss of accuracy.
Findings
AIMS selects mutants that infer 96.15% of ground truth assertions.
AIMS runs 46.29 times faster than full mutation analysis.
AIMS infers 36% more assertions than random mutant selection.
Abstract
Specification inference techniques aim at (automatically) inferring a set of assertions that capture the exhibited software behaviour by generating and filtering assertions through dynamic test executions and mutation testing. Although powerful, such techniques are computationally expensive due to a large number of assertions, test cases and mutated versions that need to be executed. To overcome this issue, we demonstrate that a small subset, i.e., 12.95% of the mutants used by mutation testing tools is sufficient for assertion inference, this subset is significantly different, i.e., 71.59% different from the subsuming mutant set that is frequently cited by mutation testing literature, and can be statically approximated through a learning based method. In particular, we propose AIMS, an approach that selects Assertion Inferring Mutants, i.e., a set of mutants that are well-suited for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoftware Testing and Debugging Techniques · Software Engineering Research · Software Reliability and Analysis Research
