On structurally testing Java programs effectively

ABSTRACT

Software testing remains the basic means of locating errors in program code. Although there is no single testing method that can isolate all sources of errors, practitioners usually adhere to these techniques in order to establish a high level of confidence at the predelivery phase. Structural testing constitutes the most popular dynamic testing method that exercises the software with test data. Most commercial tools employ this technique as the basis in order to establish a level of confidence in the software under test. In this paper a method to perform structural testing effectively is presented which also reduces the incidence of infeasible paths.

REFERENCES

• 1: J. Doyle , C. Meudec, IBIS: an Interactive Bytecode Inspection System, using symbolic execution and constraint logic programming, Proceedings of the 2nd international conference on Principles and practice of programming in Java, June 16-18, 2003, Kilkenny City, Ireland
• 2: M. R. Girgis, An experimental evaluation of a symbolic execution system, Software Engineering Journal, v.7 n.4, p.285-290, July 1992
• 3: P. D. Coward, D. Ince, The symbolic execution of software. The SYM-BOL system (Great Britain: Chapman & Hall, 1995) 1st edn.
• 4: D. Ince, The automatic generation of test data, Computer Journal, 30(1), 1987, 63--69.
• 5: D. Yates , N. Malevris, Reducing the effects of infeasible paths in branch testing, ACM SIGSOFT Software Engineering Notes, v.14 n.8, p.48-54, Dec. 1989
• 6: S. C. Ntafos, S. L. Hakimi, On path cover problems in digraphs and applications to program testing, IEEE Transactions on Software Engineering, 1979, SE-5, 520--529
• 7: H. S. Wang, S. R. Hsu, J. C. Lin, A generalized optimal path selection model for structural program testing, The Journal of Systems and Software, 1989, 10, 55--63
• 8: Antonia Bertolino , Martina Marré, Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs, IEEE Transactions on Software Engineering, v.20 n.12, p.885-899, December 1994 [doi>10.1109/32.368137 ]
• 9: C. Koutsikas, T. Andronikos, A Complete Path Generation Algorithm for Testing Criteria, Dep. of Comp. Science, National Technical University of Athens, 1996
• 10: E. Siougle, 'Development of a System for Testing Programs' Master Thesis-in Greek, Athens University of Economics and Business, Athens, 1998.
• 11: C. Koutsikas, N. Malevris, 'Test Data Generation with the Aid of Symbolic Execution', Proceedings of the International Symposium on Applied Informatics, IASTED, Innsbruck, February 2001.
• 12: P. Deepak, <u>http://www.programmersheaven.com</u>, 2004
• 13: M. R. Woodward, 'An Investigation into Program Paths and their Representation', Techniques et Sciences Informatiques, vol 3, No 4, 1984
• 14: C. Koutsikas , N. Malevris, A Unified Symbolic Execution System, Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications, p.466, June 25-29, 2001
• 15: James C. King, Symbolic execution and program testing, Communications of the ACM, v.19 n.7, p.385-394, July 1976 [doi>10.1145/360248.360252]
• 16: E. J. Weyuker The Applicability of Program Schema Results to Programs, Int. J. Comput. Inf. Sci.(8), 1979.

INDEX TERMS

Keywords:
dynamic testing, infeasible paths, software testing, structural testing, test data generation