This paper introduces an approach for adding graph transformation-based functionality to existing Java programs. The approach relies on a set of annotations to identify the intended graph structure, as well as on user methods to manipulate that structure, within the user's own Java class declarations. Other ingredients are a custom transformation language, called Chart, and a compiler from Chart to Java. The generated Java code runs against the pre-existing, annotated code. The advantage of the approach is that it allows any Java program to be enhanced, non invasively, with declarative graph rules, improving clarity, conciseness and verifiability. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
De Mol, M., Rensink, A., & Hunt, J. J. (2012). Graph transforming java data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7212 LNCS, pp. 209–223). https://doi.org/10.1007/978-3-642-28872-2_15
Mendeley helps you to discover research relevant for your work.