Using Graph Transformations and Graph Abstractions for Software Verification

Andrea Corradini (Editor), Eduardo Zambon, Arend Rensink

    Research output: Contribution to journalArticleAcademicpeer-review

    5 Citations (Scopus)


    In this paper we describe our intended approach for the verification of software written in imperative programming languages. We base our approach on model checking of graph transition systems, where each state is a graph and the transitions are specified by graph transformation rules. We believe that graph transformation is a very suitable technique to model the execution semantics of languages with dynamic memory allocation. Furthermore, such representation allows us to investigate the use of graph abstractions, which can mitigate the combinatorial explosion inherent to model checking. In addition to presenting our planned approach, we reason about its feasibility, and, by providing a brief comparison to other existing methods, we highlight the benefits and drawbacks that are expected.
    Original languageUndefined
    Pages (from-to)1-13
    Number of pages13
    JournalEASST electronic communications
    Publication statusPublished - Aug 2011
    EventFifth International Conference on Graph Transformations - Doctoral Symposium, ICGT-DS 2010 - Enschede, The Netherlands
    Duration: 29 Sep 20101 Oct 2010


    • Graph Transformation
    • METIS-279185
    • EWI-20551
    • IR-78124
    • Graph Abstraction
    • GROOVE
    • Software Model Checking

    Cite this