Affiliation:
1. Beijing University of Chemical Technology
Abstract
With the complexity of language structure, the problem of slice’s executability has gradually become people’s focus of attention. The research combines program slicing and path coverage according to their features, makes an attempt to propose the model of executable program slicing, and presents the executable slicing algorithm, which plays an important role in the automation of software analysis.
Publisher
Trans Tech Publications, Ltd.
Reference8 articles.
1. Weiser, M. (1979), Program slices: formal, psychological, and practical investigations of an automatic program abstraction method, PhD thesis, University of Michigan, Ann Arbor, (1979).
2. Zhao, J., Cheng, J., Ushijima, K., Computing executable slices for concurrent logic programs", Second Asia-Pacific Conference on Quality Software Proceedings (APAQS , 01), 2001 p.13–22, DOI: 10. 1109/APAQS. 2001. 989997.
3. Kiss, A.; Jasz, J.; Lehotai, G.; Gyimothy, T., Interprocedural static slicing of binary executables". Proceedings. Third IEEE International Workshop on Source Code Analysis and Manipulation(SCAM , 03), 2003, pp: 118 - 127 10. 1109/SCAM. 2003. 1238038.
4. Binkley, D.; Danicic, S.; Gyimothy, T.; Harman, M.; Kiss, A.; Ouarbya, L., Formalizing executable dynamic and forward slicing", Fourth IEEE International Workshop on Source Code Analysis and Manipulation(SCAM , 04), 2004, pp.43-52.
5. Danicic, S.; De Lucia, A.; Harman, M., Building executable union slices using conditioned slicing", Proceedings. 12th IEEE International Workshop on Program Comprehension(WPC , 04). 2004 , pp.89-97 , DOI: 10. 1109/WPC. 2004. 1311051.