Abstract
This paper presents an approach that provides a polynomial time solution for the problem of test suite reduction or test case selection. The proposed algorithm implements dynamic programming as an optimisation technique that uses memorisation which is conceptually similar to the technique used in Floyd–Warshall’s algorithm for all pair shortest path problem. The approach presents encouraging results on TCAS code in C language from Software-artifact Infrastructure Repository (SIR).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Tallam, S., Gupta, N.: A concept analysis inspired greedy algorithm for test suite minimization. SIGSOFT Softw. Eng. Notes 31(1), 35–42 (2006)
Zhang, L., Marinov, D., Zhang, L., Khurshid, S.: An empirical study of JUnit test-suite reduction. In: 2011 IEEE 22nd International Symposium on Software Reliability Engineering (ISSRE), pp. 170–179 (2011)
DeMillo, R.A., Lipton, R.J., Sayward, F.G.: Hints on test data selection: help for the practicing programmer. Computer 11, 34–41 (1978)
Hamlet, R.G.: Testing programs with the aid of a compiler. IEEE Trans. Softw. Eng. 3(4), 279–290 (1977)
Jia, Y., Harman, M.: An analysis and survey of the development of mutation testing. IEEE Trans. Softw. Eng. 37(5), 649–678 (2010)
Floyd, R.: Algorithm 97: shortest path. Commun. ACM 5(6) (1962)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: The Floyd-Warshall algorithm. In: Introduction to Algorithms, pp. 558–565. MIT Press and McGraw-Hill (1990)
Ingerman, P.: Algorithm 141: path matrix. Commun. ACM 5(11) (1962)
Partridge, E., Dalzell, T., Victor, T.: The Concise New Partridge Dictionary of Slang. Psychology Press (2007)
Offutt, A.J., Pan, J., Voas, J.M.: Procedures for reducing the size of coverage-based test sets. In: Twelfth International Conference on Testing Computer Software, Washington, D.C., pp. 111–123 (1995)
Hsu, H.Y., Orso, A.: MINTS: a general framework and tool for supporting test-suite minimization. In: IEEE Computer Society, pp. 419–429 (2009)
Agrawal, H.: Dominators, super blocks, and program coverage principles of programming languages. In: Symposium on 21st ACM SIGPLAN-SIGACT, Portland, Oregon (1994)
Agrawal, H.: Efficient coverage testing using global dominator graphs. In: ACM Sigplan-sigsoft Workshop on Program Analysis for Software Tools and Engineering, Toulouse, France (1999)
Black, J., Melachrinoudis, E., Kaeli, D.: Bi-criteria models for all-uses test suite reduction. In: 26th International Conference on Software Engineering(ICSE’04), Washington, D.C., USA, pp. 106–115 (2004)
Yoo, S., Harman, S.U.M.: Highly scalable multi objective test suite minimisation using graphics cards. In: Search Based Software Engineering, pp. 219–236. SpringerLink (2011)
Yoo, S., Harman, M.: Using hybrid algorithm for Pareto efficient multi-objective test suite minimisation. J. Syst. Softw. 83(4), 689–701 (2010)
Jia, Y., Harman, M.: Constructing subtle faults using higher order mutation testing. In: 8th International Working Conference on Source code Analysis and Manipulation (SCAM 2008), pp. 249–258 (2008)
Papadakis, M., Malevris, N.: Automatic mutation test case generation via dynamic symbolic execution. In: 21st International Symposium on Reliability Software Engineering, pp. 121–130 (2010)
Do, H., Elbaum, S.G., Rothermel, G.: Supporting controlled experimentation with testing techniques: an infrastructure and its potential impact. Empirical Softw. Eng. Int. J. 10(4), 405–435 (2005)
Jia, Y., Harman, M.: MILU: a customizable, runtime-optimized higher order mutation testing tool for the full C language. In: Practice and Research Techniques, 2008. TAIC PART’08. Testing: Academic & Industrial Conference, Windsor, 29–31 Aug 2008, pp. 94–98 (Online). http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=4670308, http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=4670308
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Jatana, N., Suri, B., Kumar, P. (2019). Mutation Testing-Based Test Suite Reduction Inspired from Warshall’s Algorithm. In: Hoda, M., Chauhan, N., Quadri, S., Srivastava, P. (eds) Software Engineering. Advances in Intelligent Systems and Computing, vol 731. Springer, Singapore. https://doi.org/10.1007/978-981-10-8848-3_33
Download citation
DOI: https://doi.org/10.1007/978-981-10-8848-3_33
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-8847-6
Online ISBN: 978-981-10-8848-3
eBook Packages: EngineeringEngineering (R0)