Nested Quantification in Graph Transformation Rules

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

    12 Citations (Scopus)
    6 Downloads (Pure)

    Abstract

    In this paper we describe a way to integrate Taentzer’s rule amalgamation with the recently proposed notions of nested graph conditions. The resulting so-called quantified graph transformation rules include (universally and existentially) quantified sub-structures in a flexible way. This can be used for instance to specify a larger-step operational semantics, thus improving the scalability of graph transformation as a technique for software verification.
    Original languageEnglish
    Title of host publicationGraph Transformations (ICGT)
    Subtitle of host publicationThird International Conference, ICGT 2006 Natal, Rio Grande do Norte, Brazil, September 17-23, 2006: Proceedings
    EditorsAndrea Corradini, Hartmut Ehrig, Ugo Montanari, Leila Ribeiro, Grzegorz Rozenberg
    Place of PublicationBerlin
    PublisherSpringer
    Pages1-13
    Number of pages13
    ISBN (Electronic)978-3-540-38872-2
    ISBN (Print)978-3-540-38870-8
    DOIs
    Publication statusPublished - Sep 2006
    Event3rd International Conference on Graph Transformations, ICGT 2006 - Natal, Brazil
    Duration: 19 Sep 200621 Sep 2006
    Conference number: 3

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer Verlag
    Number2
    Volume4178
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference3rd International Conference on Graph Transformations, ICGT 2006
    Abbreviated titleICGT
    CountryBrazil
    CityNatal
    Period19/09/0621/09/06

    Keywords

    • Application condition
    • Graph transformation
    • Interaction scheme
    • Graph transformation rule
    • Host graph

    Fingerprint Dive into the research topics of 'Nested Quantification in Graph Transformation Rules'. Together they form a unique fingerprint.

    Cite this