Graph Transforming Java Data

M.J. de Mol, Arend Rensink, James J. Hunt

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    4 Citations (Scopus)
    1 Downloads (Pure)

    Abstract

    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 veri﬿ability.
    Original languageUndefined
    Title of host publicationProceedings of the 15th International Conference on Fundamental Approaches to Software Engineering (FASE 2012)
    Place of PublicationLondon
    PublisherSpringer
    Pages209-223
    Number of pages15
    ISBN (Print)978-3-642-28872-2
    DOIs
    Publication statusPublished - Mar 2012
    Event15th International Conference on Fundamental Approaches to Software Engineering (FASE 2012), Talinn, Estonia: Proceedings of the 15th International Conference on Fundamental Approaches to Software Engineering (FASE 2012) - London
    Duration: 1 Mar 2012 → …

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer Verlag
    Volume7212

    Conference

    Conference15th International Conference on Fundamental Approaches to Software Engineering (FASE 2012), Talinn, Estonia
    CityLondon
    Period1/03/12 → …

    Keywords

    • IR-79456
    • EWI-21270
    • METIS-285001

    Cite this