Branch-coverage testability transformation for unstructured programs

Computer Journal

Volumn 48, Issue 4, 2005, Pages 421-436

  Hierons, Rob M ^a   Harman, M ^b   Fox, C J ^c  

^a BRUNEL UNIVERSITY   (United Kingdom)

^b KING'S COLLEGE LONDON   (United Kingdom)

^c UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC PROGRAMMING; CODES (SYMBOLS); DESIGN FOR TESTABILITY; GRAPH THEORY; SYNTACTICS;

CONTROL FLOW GRAPH (CFG); SOFTWARE TESTING; TEST DATA GENERATION; UNSTRUCTURED PROGRAMS;

SOFTWARE ENGINEERING;

EID: 25844493570     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/bxh093     Document Type: Article

References (41)

1. Boehm, B. W. (1981) Software Engineering Economics. Prentice Hall, Englewood Cliffs, NJ.
2. Clarke, L. A. (1976) A system to generate test data and symbolically execute programs. IEEE Trans. Softw. Eng., 2, 215-222.
3. Goldberg, A., Wang, T. C. and Zimmerman, D. (1994) Applications of feasible path analysis to program testing. In Ostrand, T. (ed.) Proc. 1994 Int. Symp. on Software Testing and Analysis (ISSTA), Seattle, WA, August 17-19, pp. 80-94. ACM Press, New York.
4. King, J. C. (1976) Symbolic execution and program testing. Commun. ACM, 19, 385-394.
5. DeMillo, R. A. and Offutt, A. J. (1993) Experimental results from an automatic test generator. ACM Trans. Softw Eng. Meth., 2, 109-127,
6. Offutt, A. J. (1990) An integrated system for automatically generating test data. In Ng, P. A., Ramamoorthy, C. V, Seifert, L. C. and Yeh, R. T. (eds) Proc. First Int. Conf. on Systems Integration, Morristown, NJ, April 23-26, pp. 694-701. IEEE Computer Society Press, Los Alamitos, California, USA.
7. Ferguson, R. and Korel, B. (1996) The chaining approach for software test data generation. ACM Trans. Softw. Eng. Meth., 5, 63-86.
8. Jones, B., Sthamer, H.-H. and Eyres, D. (1996) Automatic structural testing using genetic algorithms. Softw. Eng. J., 11, 299-306.
9. Michael, C., McGraw, G. and Schatz, M. (2001) Generating software test data by evolution. IEEE Trans. Softw. Eng., 27, 1085-1110.
10. Mueller, F. and Wegener, J. (1998) A comparison of static analysis and evolutionary testing for the verification of timing constraints. In Proc. 4th IEEE Real-Time Technology and Applications Symposium (RTAS '98), Denver, CO June 3-5, pp. 144-154. IEEE Computer Society Press, Los Alamitos, CA, USA.
11. Pargas, R. P., Harrold, M. J. and Peck, R. R. (1999) Test-data generation using genetic algorithms. The Journal of Software Testing, Verification and Reliability, 9, 263-282.
12. Pohlheim, H. and Wegener, J. (1999) Testing the temporal behavior of real-time software modules using extended evolutionary algorithms. In Banzhaf, W., Daida, J., Eiben, A. E., Garzon, M. H., Honavar, V, Jakiela, M. and Smith, R. E. (eds) Proc. Genetic and Evolutionary Computation Conference, Orlando, FL, July 13-17, p. 1795. Morgan Kaufmann, San Francisco, CA 94104, USA.
13. Schultz, A., Grefenstette, J. and Jong, K. (1993) Test and evaluation by genetic algorithms. IEEE Expert, 8, 9-14,
14. Tracey, N., Clark, J., Mander, K. and McDermid, J. (2000) Automated test-data generation for exception conditions. Software Prac. Exper., 30, 61-79.
15. DeMillo, R. and Offutt, A. J. (1991) Constraint-based automatic test data generation. IEEE Trans. Softw. Eng., 17, 900-910.
16. Ferrante, J., Ottenstein, K. J. and Warren, J. D. (1987) The program dependence graph and its use in optimization. ACM Trans. Progr Lang. Sys., 3, 319-349.
17. Agrawal, H. (1994) On slicing programs with jump statements. In Proc. ACM SIGPLAN, Conf. Programming Language Design and Implementation, Orlando, FL, June 20-24, pp. 302-312. ACM Press, New York, NY.
18. Ball, T. and Horwitz, S. (1993) Slicing programs with arbitrary control-flow. In Fritzson, P. (ed.) 1st Conf. on Automated Algorithmic Debugging, Linköping, Sweden, May 3-5, LNCS 749, 206-222. Springer-Verlag, Heidelberg.
19. Choi, J. and Ferrante, J. (1994) Static slicing in the presence of goto statements. ACM Trans. Progr. Lang. Sys., 16, 1097-1113.
20. Sinha, S., Harrold, M. J. and Rothermel, G. (1999) System-dependence-graph-based slicing of programs with arbitrary interprocedural control-flow. In Proc. 21st Int. Conf on Software Engineering, Los Angeles, CA, May 16-22, pp. 432-441. ACM Press, New York, NY.
21. Ramshaw, L. (1988) Eliminating goto's while preserving program structure. J. ACM, 35, 893-920,
22. Erosa, A. M. and Hendren, L. J. (1994) Taming control flow: A structured approach to eliminating GOTO statements. In Proc. IEEE Int. Conf on Computer Languages, Toulouse, France, May 16-19, pp. 229-240. IEEE Computer Society Press, Los Alamitos, CA.
23. Harman, M., Hu, L., Hierons, R. M., Wegener, J., Sthamer, H., Baresel, A. and Roper, M. (2004) Testability transformation. IEEE Trans. Software Eng., 30, 3-16.
24. Ward, M. (1999) Assembler to C migration using the FermaT transformation system. In Proc. IEEE Int. Conf. on Software Maintenance (ICSM'99), Oxford, UK, August 30-September 3, pp. 67-76. IEEE Computer Society Press, Los Alamitos, CA.
25. Jones, B. F., Eyres, D. E. and Sthamer, H.-H. (1998) A strategy for using genetic algorithms to automate branch and fault-based testing. Comp. J., 41, 98-107.
26. Tracey, N., Clark, J. and Mander, K. (1998) Automated program flaw finding using simulated annealing. In Proc. Int. Symp. on Software Testing and Analysis, Clearwater Beach, FL, March 2-5, pp. 73-81. ACM Press, New York, NY.
27. Wegener, J., Sthamer, H., Jones, B. F. and Eyres, D. E. (1997) Testing real-time systems using genetic algorithms. Software Qual. J., 4, 127-135.
28. Voas, J. M. and Miller, K. W. (1995) Software testability: The new verification. IEEE Software, 12, 17-28.
29. Böhm, C. and Jacopini, G. (1966) Flow diagrams, Turing machines, and languages with only two formation rules. Commun. ACM, 9, 366-372. Presented as an invited talk at the 1964 International Colloquium on Algebraic Linguistics and Automata Theory.
30. Cooper, D. (1967) Böhm and Jacopini's reduction of flow charts. Commun. ACM, 10, 463-473.
31. Dijkstra, E. W. (1972) A Discipline of Programming. Prentice Hall, Englewood Cliffs, NJ.
32. Harel, D. (1980) On folk theorems. Commun. ACM, 23, 379-389.
33. Kosaraju, S. R. (1974) Analysis of structured programs. J. Comput. Syst. Sci., 9, 232-255.
34. Peterson, W. W., Kasami, T. and Tokura, N. (1973) On the capabilities of while, repeat, and exit statements. Commun. ACM, 16, 503-512.
35. Ward, M. (1994) Reverse engineering through formal transformation. Comp. J., 37, 795-813.
36. Knuth, D. E. and Floyd, R. W. (1971) Notes on avoiding 'go to' statements. Inform. Process. Lett., 1, 23-31.
37. Dolado, J. J., Harman, M., Otero, M. C. and Hu, L. (2003) An empirical investigation of the influence of a type of side effects on program comprehension. IEEE Trans. Softw. Eng., 29, 665-670.
38. Harman, M., Hu, L., Zhang, X. and Munro, M. (2001) Side-effect removal transformation. In Proc. 9th IEEE Int. Workshop on Program Comprehension (IWPC'01), Toronto, Canada, May 12-13, pp. 310-319. IEEE Computer Society Press, Los Alamitos, CA.
39. Aho, A. V, Sethi, R. and Ullman, J. D. (1986) Compilers: Principles, Techniques and Tools. Addison Wesley, Reading, MA.
40. Sivagurunathan, Y, Harman, M. and Danicic, S. (1997) Slicing, I/O and the implicit state. In Kamkar, M. (ed.) 3rd Int. Workshop on Automated Debugging (AADEBUG'97), Linköping, Sweden, May 26-27, Linköping Electronic Articles in Computer and Information Science, 2, 59-65.
41. RTCA/DO-178B (1992) Software Considerations in Airborne Systems and Equipment Certification. RTA, Washington, DC.