ACM Home Page
Please provide us with feedback. Feedback
Feasible test path selection by principal slicing
Full text PdfPdf (1.49 MB)
Source Foundations of Software Engineering archive
Proceedings of the 6th European SOFTWARE ENGINEERING conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering table of contents
Zurich, Switzerland
Pages: 378 - 394  
Year of Publication: 1997
ISBN:3-540-63531-9
Also published in ...
Authors
Sponsors
University of Zurich : University of Zurich
CEPIS : Council of European Professional Informatics Societies
SIGSOFT: ACM Special Interest Group on Software Engineering
Swiss Informaticians Society : Swiss Information Society
Publisher
Springer-Verlag New York, Inc.  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 21,   Citation Count: 6
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/267895.267922
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
 
5
 
6
7
8
 
9
 
10
 
11
 
12
B. Korel. Dynamic method for software test data generation. J. Softw. Testing Verif. Reliab. 2(4):203-213, (1992)
 
13
 
14
15
16
 
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
20
 
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).


Collaborative Colleagues:
István Forgács: colleagues
Antonia Bertolino: colleagues