A Type Graph Model for Java Programs

Authors:
Arend Rensink;Eduardo Zambon
Affiliations:
Formal Methods and Tools Group, EWI-INF, University of Twente, Enschede, The Netherlands 7500 AE;Formal Methods and Tools Group, EWI-INF, University of Twente, Enschede, The Netherlands 7500 AE
Venue:
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Year:
2009

Citing 5
Cited 2

Design patterns: elements of reusable object-oriented software

Design patterns: elements of reusable object-oriented software
Principles of Program Analysis

Principles of Program Analysis
Creating and reconciling diagrams after executing model transformations

Science of Computer Programming
Principles of Model Checking (Representation and Mind Series)

Principles of Model Checking (Representation and Mind Series)
Defining object-oriented execution semantics using graph transformations

FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems

Using graph transformations and graph abstractions for software verification

ICGT'10 Proceedings of the 5th international conference on Graph transformations
The edge of graph transformation: graphs for behavioural specification

Graph transformations and model-driven engineering

Quantified Score

Hi-index	0.00

Visualization

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.