A Type Graph Model for Java Programs (original) (raw)
2009, Lecture Notes in Computer Science
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. AbsVarDecl Java code example Corresponding syntax graph Comments • This node type is abstract. See also pages 22, 50, 56, 61, and 90 for the concrete subtypes of this node type. BranchStmt LabeledStmt label 0..1 Java code example Corresponding syntax graph Comments
Sign up for access to the world's latest research.
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.