Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

The Java system dependence graph

Walkinshaw, N. and Roper, M. and Wood, M. (2003) The Java system dependence graph. In: Proceedings of Source Code Analysis and Manipulation (SCAM'03), 2003-09-26 - 2003-09-27, Amsterdam, The Netherlands.

[img]
Preview
PDF (strathprints001956.pdf)
Download (174Kb) | Preview

    Abstract

    The Program Dependence Graph was introduced by Ottenstein and Ottenstein in 1984 [14]. 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 multi-procedural equivalent System Dependence Graph [9]. Many authors have proposed object-oriented dependence graph construction approaches [11, 10, 20, 12]. Every approach provides its own benefits, some of which are language specific. This paper is based on Java and combines the most important benefits from a range of approaches. The result is a Java System Dependence Graph, which summarises the key benefits offered by different approaches and adapts them (if necessary) to the Java language.

    Item type: Conference or Workshop Item (Paper)
    ID code: 1956
    Keywords: program dependence graph, Java, Electronic computers. Computer science
    Subjects: Science > Mathematics > Electronic computers. Computer science
    Department: Faculty of Science > Computer and Information Sciences
    Unknown Department
    Related URLs:
      Depositing user: Strathprints Administrator
      Date Deposited: 06 Nov 2006
      Last modified: 06 Sep 2014 13:51
      URI: http://strathprints.strath.ac.uk/id/eprint/1956

      Actions (login required)

      View Item

      Fulltext Downloads: