A Slicing Method for Object-Oriented Programs Using Lightweight Dynamic Information

Authors:
Fumiaki Ohata;Kouya Hirose;Masato Fujii;Katsuro Inoue
Affiliations:
-;-;-;-
Venue:
APSEC '01 Proceedings of the Eighth Asia-Pacific on Software Engineering Conference
Year:
2001

Citing 0
Cited 6

Using Compressed Bytecode Traces for Slicing Java Programs

Proceedings of the 26th International Conference on Software Engineering
A brief survey of program slicing

ACM SIGSOFT Software Engineering Notes
Static object trace extraction for programs with pointers

Journal of Systems and Software - Special issue: Software reverse engineering
Dynamic slicing on Java bytecode traces

ACM Transactions on Programming Languages and Systems (TOPLAS)
Dynamic object process graphs

Journal of Systems and Software
Measurement of dynamic metrics using dynamic analysis of programs

ACC'08 Proceedings of the WSEAS International Conference on Applied Computing Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Program slicing has been used or efficient program debugging activities.Program slice is computed by analyzing dependence relations between program statements.We can divide dependence analyses into two categories, static and dynamic; the former requires little analysis costs, but the resulting slices are large.The latter has opposite characters.In this paper, we propose a program slicingmethod for Object-Oriented programs and evaluate its effectiveness with some JAVA programs.Since Object-Oriented languages havemany dynamically determined elements, static analysis could not compute practical analysis results.Our method uses static and dynamic analyses appropriately and computes accurate slices with lightweight costs.