MINTS: A general framework and tool for supporting test-suite minimization

Proceedings - International Conference on Software Engineering

Volumn , Issue , 2009, Pages 419-429

  Hsu, Hwa You ^a   Orso, Alessandro ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EMPIRICAL EVALUATIONS; INTEGER LINEAR PROGRAMMING; MINIMIZATION PROBLEMS; OPTIMAL SOLUTIONS; REDUNDANT TESTS; SUBOPTIMAL SOLUTION; WIDE SPECTRUM;

COMPUTER SOFTWARE; FAULT DETECTION; INTEGER PROGRAMMING; LINEARIZATION; MINTS; OPTIMAL SYSTEMS; TESTING;

OPTIMIZATION;

EID: 77949900972     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSE.2009.5070541     Document Type: Conference Paper

References (20)

1. H. Agrawal. Efficient coverage testing using global dominator graphs. In Proceedings of PASTE 99, pages 11-20, 1999.
2. P. Barth. A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization. Research Report MPI-I-95-2-003, Max-Planck-Institut für Informatik, January 1995.
3. D. L. Berre and A. Parrain. On extending SAT solvers for PB problems. In RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, July 2007.
4. J. Black, E. Melachrinoudis, and D. Kaeli. Bi-criteria models for all-uses test suite reduction. In ICSE 04, pages 106-115, May 2004.
5. V. Chavatal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4(3), Agust 1979.
6. T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson. Introduction to Algorithms. The MIT Press, Cambridge, Massachusetts, 2001.
7. M. J. Harrold, R. Gupta, and M. L. Soffa. A methodology for controlling the size of a test suite. ACM TOSEM, 2(3):270-285, July 1993.
8. D. Jeffrey and N. Gupta. Improving fault detection capability by selectively retaining test cases during test suite reduction. IEEE TSE, 33(2):108-123, 2007.
9. J.-M. Kim and A. Porter. A history-based test prioritization technique for regression testing in resource constrained environments. In ICSE 02), pages 119-129, 2002.
10. H. K. N. Leung and L. J. White. A cost model to compare regression test strategies. In ICSM 91, pages 201-208, October 1991.
11. M. Marre and A. Bertolino. Using spanning set for coverage testing. IEEE TSE, 29(11):974-984, November 2003.
12. Pseudo-boolean evaluation 2007. http://www.cril.univ-artois.fr/PB07/, 2007.
13. G. Rothermel and M. J. Harrold. A safe, efficient regression test selection technique. ACM TOSEM, 6(2):173-210, April 1997.
14. G. Rothermel, M. J. Harrold, J. Ostrin, and C. Hong. An empirical study of the effects of minimization on the fault-detection capabilities of test suites. In ICSM 98, pages 34-43, November 1998.
15. G. Rothermel, R. H. Untch, C. Chu, and M. J. Harrold. Test Case Prioritization. IEEE TSE, 27(10):929-948, October 2001.
16. A. Srivastava and J. Thiagarajan. Effectively prioritizing tests in development environment. In ISSTA 02, pages 97-106, July 2002.
17. S. Tallam and N. Gupta. A concept analysis inspired greedy algorithm for test suite minimization. In PASTE 05, pages 35-42, September 2005.
18. F. Vokolos and P. Frankl. Pythia: A regression test selection tool based on text differencing. In Int'l Conf on Reliability, Quality and Safety of Software-intensive Systems, pages 3-21, May 1997.
19. H. P. Williams. Model Building in Mathematical Programming. John Wiley, 1993.
20. W. E. Wong, J. R. Horgan, S. London, and A. P. Mathur. Effect of test set minimization on fault detection effectiveness. In ICSE 95, pages 41-50, April 1995.