### Abstract

Original language | Undefined |
---|---|

Title of host publication | Verification of Evolving Graph Structures |

Editors | Parosh Aziz Abdulla, Fabio Gadducci, Barbara König, Viktor Vafeiadis |

Place of Publication | Dagstuhl, Germany |

Publisher | Dagstuhl Publishing |

Pages | 18-18 |

Number of pages | 1 |

DOIs | |

Publication status | Published - Mar 2016 |

### Publication series

Name | Dagstuhl Reports |
---|---|

Publisher | Dagstuhl Publishing |

Number | 11 |

Volume | 5 |

ISSN (Print) | 2192-5283 |

### Keywords

- EWI-26905
- METIS-316865
- IR-100130

### Cite this

*Verification of Evolving Graph Structures*(pp. 18-18). (Dagstuhl Reports; Vol. 5, No. 11). Dagstuhl, Germany: Dagstuhl Publishing. https://doi.org/10.4230/DagRep.5.11.1

}

*Verification of Evolving Graph Structures.*Dagstuhl Reports, no. 11, vol. 5, Dagstuhl Publishing, Dagstuhl, Germany, pp. 18-18. https://doi.org/10.4230/DagRep.5.11.1

**Verification Techniques for Graph Rewriting (Tutorial).** / Rensink, Arend.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

TY - GEN

T1 - Verification Techniques for Graph Rewriting (Tutorial)

AU - Rensink, Arend

N1 - eemcs-eprint-26905

PY - 2016/3

Y1 - 2016/3

N2 - This tutorial paints a high-level picture of the concepts involved in verification of graph transformation systems. We distinguish three fundamentally different application scenarios for graph rewriting: (1) as grammars (in which case we are interested in the language, or set, of terminal graphs for a fixed start graph); (2) as production systems (in which case we are interested in the relation between start and terminal graphs); or (3) as behavioural specifications (in which case we are interested in the transition system as a whole). We then list some types of questions one might want to answer through verification: confluence and termination, reachability, temporal properties, or contractual properties. Finally, we list some techniques that can help in providing answers: model checking, unfolding, assertional reasoning, and abstraction.

AB - This tutorial paints a high-level picture of the concepts involved in verification of graph transformation systems. We distinguish three fundamentally different application scenarios for graph rewriting: (1) as grammars (in which case we are interested in the language, or set, of terminal graphs for a fixed start graph); (2) as production systems (in which case we are interested in the relation between start and terminal graphs); or (3) as behavioural specifications (in which case we are interested in the transition system as a whole). We then list some types of questions one might want to answer through verification: confluence and termination, reachability, temporal properties, or contractual properties. Finally, we list some techniques that can help in providing answers: model checking, unfolding, assertional reasoning, and abstraction.

KW - EWI-26905

KW - METIS-316865

KW - IR-100130

U2 - 10.4230/DagRep.5.11.1

DO - 10.4230/DagRep.5.11.1

M3 - Conference contribution

T3 - Dagstuhl Reports

SP - 18

EP - 18

BT - Verification of Evolving Graph Structures

A2 - Abdulla, Parosh Aziz

A2 - Gadducci, Fabio

A2 - König, Barbara

A2 - Vafeiadis, Viktor

PB - Dagstuhl Publishing

CY - Dagstuhl, Germany

ER -