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.
|Name||Lecture Notes in Computer Science|
|Conference||Joint 11th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Systems, FMOODS/FORTE 2009|
|Period||9/06/09 → 12/06/09|
- Type graph
- Java semantics
- Syntax graph
- Model transformation