PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Forgacs I., Bertolino A. Feasible test path selection by principal slicing. In: ESEC/FSE'97 - Proceedings o6th European Software Engineering Conference Held Jointly with the 5th ACM SIGSOFT Symposium on the Foundations of Software Engineering (Zurich, Switzerland, 1997). Proceedings, pp. 378 - 394. Mehdi Jazayeri, Helmut Schauer (eds.). (Lecture notes in computer science, vol. 1301). Springer, 1997.
 
 
Abstract
(English)
We propose to improve current path-wise methods for automatic test data generation by using a new method named principal slicing. This method statically clerives program slices with a near minimum number of influencing prediicates, using both control and data flow information. Paths clerived on principal slices to reach a certain program point are therefore very likely to be feasible. We discuss how our method improves on early proposed approaches, both static and dynaniic. We also (provide an algorithm for deriving principal slice. Then we illustrate the application of principal slicing to testing, considering a specific test criterion as an example. namely branch coverage. The example provided is an optimised method for automated branch testing: not only do we yse principal slicing to obtain feasible tesi paths, but also we use the concept of spanning sets of branches to guide the selection of each next path, which prevents the generation of redundant tests.
DOI: 10.1007/3-540-63531-9_26
Subject Automatic test data generation
Ddgraph
Influencing predicates
PDG
Principal definition


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional