Abstract Graph Transformation

Arend Rensink, Dino Distefano

    Research output: Book/ReportReportProfessional

    39 Downloads (Pure)

    Abstract

    Graphs may be used as representations of system states in operational semantics and model checking; in the latter context, they are being investigated as an alternative to bit vectors. The corresponding transitions are obtained as derivations from graph production rules. In this paper we propose an abstraction technique in this framework: the state graphs are contracted by collecting nodes that are sufficiently similar (resulting in smaller states and a finite state space) and the application of the graph production rules is lifted to this abstract level. Since graph abstractions and rule applications can all be computed completely automatically, we believe that this can be the core of a practically feasible technique for software model checking.
    Original languageEnglish
    Place of PublicationEnschede
    PublisherCentre for Telematics and Information Technology (CTIT)
    Number of pages21
    Publication statusPublished - Jan 2005

    Publication series

    NameCTIT Technical Report Series
    PublisherUniversity of Twente, CTIT
    No.TR-CTIT-05-04
    ISSN (Print)1381-3625

    Keywords

    • Graph Transformation
    • Abstract interpretation
    • Software model checking

    Fingerprint Dive into the research topics of 'Abstract Graph Transformation'. Together they form a unique fingerprint.

  • Cite this

    Rensink, A., & Distefano, D. (2005). Abstract Graph Transformation. (CTIT Technical Report Series; No. TR-CTIT-05-04). Enschede: Centre for Telematics and Information Technology (CTIT).