Abstract
Reducing test suites is crucial for reducing the test cost, for the test cost is directly proportional to the size of test suites. Reducing the test cost is particularly important when we need to urgently develop a stable compiler for a newly developed processor. In this paper, we propose a framework to reduce test suites for retargeted compilers using intermediate representations of test input programs. We describe that redundancy of test cases at the level of source codes exists from the viewpoint of intermediate representation and, thus, testing efficiency can be improved by excluding those redundant test cases. We also conduct a case study with RTL where we found that test suite can be considerably reduced. In addition, we show that the fault detection capability can be maintained with the reduced test suites by means of mutation testing.
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
Preview
Unable to display preview. Download preview PDF.
References
Beizer, B.: Software Testing Techniques. John Wiley & Sons, Inc, New York (1990)
Boujarwah, A., Saleh, K.: Compiler test case generation methods: a survey and assessment. Information and Software Technology 39, 617–625 (1997)
Kossatchev, A., Posypkin, M.: Survey of compiler testing methods. Programming and Computer Software 31, 10–19 (2005)
Harm, J., Lämmel, R.: Two-dimensional approximation coverage. Informatica (Slovenia), 24 (2000)
Hannan, J., Pfenning, F.: Compiler verification in LF. In: Scedrov, A. (ed.) Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp. 407–418. IEEE Computer Society Press, Los Alamitos (1992)
Lämmel, R.: Grammar Testing. In: Hussmann, H. (ed.) ETAPS 2001 and FASE 2001. LNCS, vol. 2029, pp. 201–216. Springer, Heidelberg (2001)
Gargantini, A., Riccobene, E.: ASM-based testing: Coverage criteria and automatic test sequence. JUCS: Journal of Universal Computer Science, vol. 7 (2001)
Zelenov, S.V., Zelenova, S.A., Kossatchev, A., Petrenko, A.: Test generation for compilers and other formal text processors. Programming and Computer Software 29, 104–111 (2003)
Kalinov, A., Kossatchev, A., Posypkin, M., Shishkov, V.: Using ASM specification for automatic test suite generation for mpC parallel programming language compiler (2002)
Kalinov, A., Kossatchev, A., Petrenko, A., Posypkin, M., Shishkov, V.: Coverage-driven automated compiler test suite generation. Electr. Notes Theor. Comput. Sci. vol. 82 (2003)
Kalinov, A., Kossatchev, A., Petrenko, A., Posypkin, M., Shishkov, V.: Using asm specifications for compiler testing (2003)
Lee, E.A.: What’s ahead for embedded software? IEEE Computer 33, 18–26 (2000)
Stallman, R.M.: Using and porting the GNU compiler collection (2001)
Miller, K.W.: A modest proposal for software testing. IEEE Softw. 18, 98–100 (2001)
Leupers, R., Marwedel, P.: Retargetable compiler technology for embedded systems: tools and applications, Norwell, MA. Kluwer Academic Publishers, Dordrecht (2001)
Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP-Completeness. W.H.Freeman and Company, New York (1979)
Malloy, B.A., Power, J.F.: An interpretation of purdom’s algorithm for automatic generation of test cases. In: Proceedings of 1st Annual International Conference on Computer and Information Science (2001)
ISO/IEC: Programming languages–c. ISO/IEC international standard 9899:1990 (e) (1990)
Bertot, Y., Grégoire, B., Leroy, X.: A structured approach to proving compiler optimizations based on dataflow analysis. In: Filliâtre, J.-C., Paulin-Mohring, C., Werner, B. (eds.) TYPES 2004. LNCS, vol. 3839, pp. 66–81. Springer, Heidelberg (2006)
DeMillo, R.A., Lipton, R., Sayward, F.: Hints on test data selection: Help for the practicing programmer. IEEE Computer 11, 34–41 (1978)
Hamlet, R.G.: Testing programs with the aid of a compiler. IEEE Trans. Software Eng. 3, 279–290 (1977)
Offutt, A.J., Lee, S.D.: An empirical evaluation of weak mutation. IEEE Transactions on Software Engineering 20, 337–344 (1994)
Howden, W.E.: Weak mutation testing and completeness of test sets. IEEE Transactions on Software Engineering SE-8, 371–379 (1982)
Kutter, P.W., Pierantonio, A.: Montages specifications of realistic programming languages. JUCS: Journal of Universal Computer Science 3, 416 (1997)
Jaramillo, C., Gupta, R., Soffa, M.L.: Comparison checking: An approach to avoid debugging of optimized code. In: ESEC / SIGSOFT FSE, pp. 268–284 (1999)
Necula, G.C.: Translation validation for an optimizing compiler. ACM SIGPLAN Notices 35, 83–94 (2000)
McNerney, T.S.: Verifying the correctness of compiler transformations on basic blocks using abstract interpretation. SIGPLAN Notices 26, 106–115 (1991)
Hennessy, M., Power, J.F.: An analysis of rule coverage as a criterion in generating minimal test suites for grammar-based software. In: ASE ’05. Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering, pp. 104–113. ACM Press, New York (2005)
Jones, J.A., Harrold, M.J.: Test-suite reduction and prioritization for modified condition/decision coverage. IEEE Trans. Softw. Eng. 29, 195–209 (2003)
Wilson, R.P., French, R.S., Wilson, C.S., Amarasinghe, S.P., Anderson, J.A.M., Tjiang, S.W.K., Liao, S.W., Tseng, C.W., Hall, M.W., Lam, M.S., Hennessy, J.L.: SUIF: An infrastructure for research on parallelizing and optimizing compilers. SIGPLAN Notices 29, 31–37 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Woo, G., Chae, H.S., Jang, H. (2007). An Intermediate Representation Approach to Reducing Test Suites for Retargeted Compilers. In: Abdennadher, N., Kordon, F. (eds) Reliable Software Technologies – Ada Europe 2007. Ada-Europe 2007. Lecture Notes in Computer Science, vol 4498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73230-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-73230-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73229-7
Online ISBN: 978-3-540-73230-3
eBook Packages: Computer ScienceComputer Science (R0)