On the application of SAT solvers to the test suite minimization problem

Authors:
Franco Arito;Francisco Chicano;Enrique Alba
Affiliations:
Departamento de Lenguajes y Ciencias de la Computación, University of Málaga, Spain;Departamento de Lenguajes y Ciencias de la Computación, University of Málaga, Spain;Departamento de Lenguajes y Ciencias de la Computación, University of Málaga, Spain
Venue:
SSBSE'12 Proceedings of the 4th international conference on Search Based Software Engineering
Year:
2012

Citing 13
Cited 0

GRASP—a new search algorithm for satisfiability

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Experiments of the effectiveness of dataflow- and controlflow-based test adequacy criteria

ICSE '94 Proceedings of the 16th international conference on Software engineering
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Supporting Controlled Experimentation with Testing Techniques: An Infrastructure and its Potential Impact

Empirical Software Engineering
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications

Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
MINTS: A general framework and tool for supporting test-suite minimization

ICSE '09 Proceedings of the 31st International Conference on Software Engineering
Time-aware test-case prioritization using integer linear programming

Proceedings of the eighteenth international symposium on Software testing and analysis
Hard and easy distributions of SAT problems

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Regression testing minimization, selection and prioritization: a survey

Software Testing, Verification & Reliability

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Test Suite Minimization problem in regression testing is a software engineering problem which consists in selecting a set of test cases from a large test suite that satisfies a given condition, like maximizing the coverage and/or minimizing the oracle cost. In this work we use an approach based on SAT solvers to find optimal solutions for the Test Suite Minimization Problem. The approach comprises two translations: from the original problem instance into Pseudo-Boolean constraints and then to a propositional Boolean formula. In order to solve a problem, we first translate it into a SAT instance. Then the SAT instance is solved using a state-of-the-art SAT solver. Our main contributions are: we create an encoding for single and multi-objective formulations of the Test Suite Minimization Problem as Pseudo-Boolean constraints and we compute optimal solutions for well-known and highly-used instances of this problem for future reference.