A Type Graph Model for Java Programs

Arend Rensink, Eduardo Zambon

    Research output: Book/ReportReportProfessional

    5 Citations (Scopus)
    94 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 speci��?cation, 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 languageUndefined
    Place of PublicationEnschede
    PublisherFormal Methods and Tools (FMT)
    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

    • EWI-15083
    • Type Graph
    • METIS-265739
    • IR-65392
    • Syntax Graph
    • Java Semantics
    • Model Transformations

    Cite this

    Rensink, A., & Zambon, E. (2009). A Type Graph Model for Java Programs. (CTIT Technical Report Series; No. TR-CTIT-09-01). Enschede: Formal Methods and Tools (FMT).
    Rensink, Arend ; Zambon, Eduardo. / A Type Graph Model for Java Programs. Enschede : Formal Methods and Tools (FMT), 2009. 94 p. (CTIT Technical Report Series; TR-CTIT-09-01).
    @book{7baf90b14c3d46fb88aa5b3549d71b47,
    title = "A Type Graph Model for Java Programs",
    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 speci��?cation, 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.",
    keywords = "EWI-15083, Type Graph, METIS-265739, IR-65392, Syntax Graph, Java Semantics, Model Transformations",
    author = "Arend Rensink and Eduardo Zambon",
    year = "2009",
    month = "2",
    day = "9",
    language = "Undefined",
    series = "CTIT Technical Report Series",
    publisher = "Formal Methods and Tools (FMT)",
    number = "TR-CTIT-09-01",

    }

    Rensink, A & Zambon, E 2009, A Type Graph Model for Java Programs. CTIT Technical Report Series, no. TR-CTIT-09-01, Formal Methods and Tools (FMT), Enschede.

    A Type Graph Model for Java Programs. / Rensink, Arend; Zambon, Eduardo.

    Enschede : Formal Methods and Tools (FMT), 2009. 94 p. (CTIT Technical Report Series; No. TR-CTIT-09-01).

    Research output: Book/ReportReportProfessional

    TY - BOOK

    T1 - A Type Graph Model for Java Programs

    AU - Rensink, Arend

    AU - Zambon, Eduardo

    PY - 2009/2/9

    Y1 - 2009/2/9

    N2 - 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 speci��?cation, 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.

    AB - 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 speci��?cation, 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.

    KW - EWI-15083

    KW - Type Graph

    KW - METIS-265739

    KW - IR-65392

    KW - Syntax Graph

    KW - Java Semantics

    KW - Model Transformations

    M3 - Report

    T3 - CTIT Technical Report Series

    BT - A Type Graph Model for Java Programs

    PB - Formal Methods and Tools (FMT)

    CY - Enschede

    ER -

    Rensink A, Zambon E. A Type Graph Model for Java Programs. Enschede: Formal Methods and Tools (FMT), 2009. 94 p. (CTIT Technical Report Series; TR-CTIT-09-01).