Author:
Güttinger Dennis,Kozyura Vitaly,Kremer Dominik,Wieczorek Sebastian
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Black, J., Melachrinoudis, E., Kaeli, D.: Bi-criteria models for all-uses test suite reduction. In: Proceedings of the 26th International Conference on Software Engineering, ICSE 2004, pp. 106–115. IEEE Computer Society, Washington, DC (2004)
2. Chen, T.Y., Lau, M.F.: A new heuristic for test suite reduction 40(5-6), 347–354 (1998)
3. Chen, T.Y., Lau, M.F.: Dividing strategies for the optimization of a test suite. Information Processing Letters 60, 135–141 (1996)
4. Chvatal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4(3), 233–235 (1979)
5. Gupta, R., Soffa, M.L.: Compile-time techniques for improving scalar access performance in parallel memories. IEEE Trans. Parallel Distrib. Syst. 2, 138–148 (1991)