Feasible test path selection by principal slicing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1301, Issue , 1997, Pages 378-394

  Forgács, István ^a   Bertolino, Antonia ^b  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b ISTI CNR   (Italy)

Author keywords

Automatic test data generation; Ddgraph; Influencing predicates; PDG; Principal definition; Slicing

Indexed keywords

AUTOMATIC TEST DATA GENERATION; DDGRAPH; INFLUENCING PREDICATES; PRINCIPAL DEFINITION; SLICING;

SOFTWARE ENGINEERING;

EID: 26744444285     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63531-9_26     Document Type: Conference Paper

References (21)

1. H. Agrawal, J.E. Horgan, E.W. Krauser and S.A. London, Incremental regression testing, Proc. of the 1993 IEEE Conf. on Software Maintenance, Montreal, Canada, 348-357 (1993)
2. B. Beizer. Software Testing Techniques, Second Edition. Van Nostrand Reinhold, New York. 1990.
3. A. Bertolino and M. Marré. Automatic generation of path covers based on the control flow analysis of computer programs. IEEE Trans, on Software Eng., 20(12):885-899, (1994).
4. L. A. Clarke. A system to generate test data and simbolically execute programs. IEEE Trans. on Software Eng., 2(3):215-222, (1976).
5. R. Conradi, Experience with FORTRAN VERIFIER - A tool for documentation an error diagnosis of FORTRAN-77 programs. Proc. 1st European Software Engineering Conference, Strasburg, France 8-11 Sept. 263-275 Springer Verlag LNCS 289 (1987)
6. R. A. DeMillo and A.J. Offutt. Constraint-based automatic test generation. IEEE Trans, on Software Eng., 17(9):900-910, (1991).
7. R. Ferguson and B. Korel. The chaining approach for software test data generation. ACM Trans, on Software Eng. and Meth., 5(1):63-86, (1996)
8. S. Horwitz, T. Reps and D. Binkley. Interprocedural slicing using dependence graphs. ACM Trans. Progr. Lang. Syst., 12(1):26-61, (1990).
9. W. E. Howden. Symbolic testing and the DISSECT symbolic evaluation system. IEEE Trans. on Software Eng., 3(4):266-278, (1977).
10. M. Kamkar. An overview and comparative classification of program slicing techniques. Journal of Systems and Software, 31(3):197-214, (1995)
11. B. Korel. Automated software test data generation. IEEE Trans. on Software Eng., 16(8):870-879, (1990).
12. B. Korel. Dynamic method for software test data generation. J. Softw. Testing Verif. Reliab. 2(4):203-213, (1992)
13. B. Korel and J. Laski. Dynamic slicing of computer programs. Journal of Systems and Software, 13(3):187-195, (1990)
14. M. Marré and A. Bertolino. Reducing and estimating the cost of test coverage criteria. In Proc. ACM/IEEE Int. Conf. Software Eng. ICSE-18, pages 486-494, Berlin, Germany, March 1996.
15. K. J. Ottenstein and L.M. Ottenstein. The program dependence graph in a software development environment. ACM SIGPLAN Notices, 19(5):177-184, (1984)
16. G.A. Venkatesh. The semantic approach to program slicing. Proc. of the ACM SIGPLAN’91 Conference on Programming Language Design and Implementation Toronto, Canada, 107-119 (1991)
17. M. Weiser. Program slicing. IEEE Trans, on Software Eng., 10(4):352-357, (1984).
18. E. Weyuker. Translatability and decidability questions for restricted classes of program schemas. SIAM Journal on Computers, 8(4):587-598, (1979)
19. L. J. White and E. I. Cohen. A domain strategy for computer program testing. IEEE Trans. on Software Eng., 6(3):247-257, (1980).
20. D. F. Yates and N. Malevris. Reducing the effects of infeasible paths in branch testing. ACM SIGSOFT Software Engineering Notes, 14(8):48-54, (1989).
21. D. F. Yates and N. Malevris. The effort required by LCSAJ testing: an assessment via a new path generation strategy. Software Quality J., 4(3):227-242, (1995).