A Type Graph Model for Java Programs

Arend Rensink, Eduardo Zambon

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Abstract

    In this work 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
    Title of host publicationFormal Techniques for Distributed Systems
    Subtitle of host publicationJoint 11th IFIP WG 6.1 International Conference FMOODS 2009 and 29th IFIP WG 6.1 International Conference FORTE 2009, Lisboa, Portugal, June 9-12, 2009. Proceedings
    EditorsDavid Lee, Antónia Lopes, Arnd Poetzsch-Heffter
    Place of PublicationBerlin, Heidelberg
    PublisherSpringer
    Pages237-242
    Number of pages6
    ISBN (Electronic)978-3-642-02138-1
    ISBN (Print)978-3-642-02137-4
    DOIs
    Publication statusPublished - 15 Jun 2009
    EventJoint 11th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Systems, FMOODS/FORTE 2009 - Lisbon, Portugal
    Duration: 9 Jun 200912 Jun 2009

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer
    Volume5522
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    ConferenceJoint 11th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Systems, FMOODS/FORTE 2009
    Abbreviated titleFMOODS/FORTE
    CountryPortugal
    CityLisbon
    Period9/06/0912/06/09

    Keywords

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

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

  • Cite this

    Rensink, A., & Zambon, E. (2009). A Type Graph Model for Java Programs. In D. Lee, A. Lopes, & A. Poetzsch-Heffter (Eds.), Formal Techniques for Distributed Systems: Joint 11th IFIP WG 6.1 International Conference FMOODS 2009 and 29th IFIP WG 6.1 International Conference FORTE 2009, Lisboa, Portugal, June 9-12, 2009. Proceedings (pp. 237-242). (Lecture Notes in Computer Science; Vol. 5522). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-02138-1_18