An Extension to Robustness Slicing Algorithm Based on Dynamic Array

Since it was introduced in 1979, program slicing has been used widely in many aspects of software engineering, such as code debugging, program comprehension, software maintenance and reverse engineering etc. Since 1995, many people have studied and developed some methods and tools to help programmers use program, slicing technique in software testing, and some valuable results have been obtained by theoretic and empirical analysis and evaluation. Research results show that program slicing is very useful for regression testing and simplifying testing. In this article, we try to extend the ability of Barman and Danicic´s robust slicing algorithm by considering how to deal with dynamically allocated storage. Especially, we discuss how to compute the robustness slice when the subscripts of an array are dynamic