Program Slicing in the Presence of Complicated Data Structure 


Vol. 10,  No. 6, pp. 999-1010, Oct.  2003
10.3745/KIPSTD.2003.10.6.999


PDF
  Abstract

Program slicing is a method to extract the statements from the program which have an influence on the value of a variable at a particular point of the program. Program slicing is applied for many applications, such as program debugging, program testing, program integration, parallel program execution, software metrics, reverse engineering, and software maintenance, etc. This paper is the study to create the exact slice in the presence of the complicated data structure including pointer variable, dereferenenced object by pointer variable, array and structure. We propose the Object Reference State Graph to generate more exactly static analysis information of objects in the program of the presence of complicated data structure.

  Statistics


  Cite this article

[IEEE Style]

L. H. Yeon, P. J. Yang, P. J. Heung, "Program Slicing in the Presence of Complicated Data Structure," The KIPS Transactions:PartD, vol. 10, no. 6, pp. 999-1010, 2003. DOI: 10.3745/KIPSTD.2003.10.6.999.

[ACM Style]

Lyu Ho Yeon, Park Jung Yang, and Park Jae Heung. 2003. Program Slicing in the Presence of Complicated Data Structure. The KIPS Transactions:PartD, 10, 6, (2003), 999-1010. DOI: 10.3745/KIPSTD.2003.10.6.999.