DocumentCode
2165781
Title
The Java system dependence graph
Author
Walkinshaw, Neil ; Roper, Marc ; Wood, Murray
Author_Institution
Strathclyde Univ., Glasgow, UK
fYear
2003
fDate
26-27 Sept. 2003
Firstpage
55
Lastpage
64
Abstract
The program dependence graph was introduced by Ottenstein and Ottenstein in 1984. It was suggested to be a suitable internal program representation for monolithic programs, for the purpose of carrying out certain software engineering operations such as slicing and the computation of program metrics. Since then, Horwitz et al. have introduced the multiprocedural equivalent system dependence graph. Several authors have proposed object-oriented dependence graph construction approaches. Every approach provides its own benefits, some of which are language specific. We present a Java system dependence graph which draws on the strengths of a range of earlier works and adapts them, if necessary, to the Java language. It also provides guidance on the construction of the graph, identifies potential research topics based on it and shows a completed graph with a slice highlighted for a small, but realistic example.
Keywords
Java; data flow graphs; object-oriented programming; program slicing; software metrics; Java system; monolithic programs; multiprocedural equivalent system; object-oriented dependence graph; program metrics; program slicing; Application software; Buildings; Conferences; Electronic mail; Java; Packaging; Poles and towers; Software engineering; Yarn;
fLanguage
English
Publisher
ieee
Conference_Titel
Source Code Analysis and Manipulation, 2003. Proceedings. Third IEEE International Workshop on
Print_ISBN
0-7695-2005-7
Type
conf
DOI
10.1109/SCAM.2003.1238031
Filename
1238031
Link To Document