A Type Graph Model for Java Programs

Arend Rensink, Eduardo Zambon

    Research output: Book/ReportReportProfessional

    5 Citations (Scopus)
    105 Downloads (Pure)

    Abstract

    In this report we present a type graph that models all executable constructs of the Java programming language. Such a model is useful for any graph-based technique that relies on a representation of Java programs as graphs. The model can be regarded as a common representation to which all Java syntax graphs must adhere. We also present the systematic approach that is being taken to generate syntax graphs from Java code. Since the type graph model is comprehensive, i.e., covers the whole language specification, the technique is guaranteed to generate a corresponding graph for any valid Java program. In particular, we want to extract such syntax graphs in order to perform static analysis and model checking of programs written in Java. Although we focus on Java, this same approach could be adapted for other programming languages.
    Original languageEnglish
    Place of PublicationEnschede
    PublisherCentre for Telematics and Information Technology (CTIT)
    Number of pages94
    Publication statusPublished - 9 Feb 2009

    Publication series

    NameCTIT Technical Report Series
    PublisherCentre for Telematics and Information Technology, University of Twente
    No.TR-CTIT-09-01
    ISSN (Print)1381-3625

    Keywords

    • Type graph
    • Syntax graph
    • Java semantics
    • Model transformation

    Fingerprint Dive into the research topics of 'A Type Graph Model for Java Programs'. Together they form a unique fingerprint.

    Cite this