A Type Graph Model for Java Programs


Share/Save/Bookmark

Rensink, Arend and Zambon, Eduardo (2009) A Type Graph Model for Java Programs. In: Formal Techniques for Distributed Systems. Lecture Notes in Computer Science, 5522 . Springer Verlag, Berlin, pp. 237-242. ISBN 9783642021374

[img]PDF
Restricted to UT campus only

194Kb
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.
Item Type:Book Section
Copyright:© 2009 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/67700
Official URL:http://dx.doi.org/10.1007/978-3-642-02138-1_18
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 265747