Abstract
| Original language | Undefined |
|---|---|
| Title of host publication | International Conference on Graph Transformations (ICGT) |
| Editors | H Ehrig, R. Heckel, G. Rozenberg, G. Taentzer |
| Place of Publication | Berlin |
| Publisher | Springer |
| Pages | 321-335 |
| Number of pages | 15 |
| ISBN (Print) | 978-3-540-87404-1 |
| DOIs | |
| Publication status | Published - 2008 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer Verlag |
| Number | Supplement |
| Volume | 5214 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Keywords
- IR-62461
- METIS-251183
- EWI-13439
Cite this
}
A Modal-Logic Based Graph Abstraction. / Bauer, J.; Boneva, I.B.; Kurban, M.E.; Rensink, Arend.
International Conference on Graph Transformations (ICGT). ed. / H Ehrig; R. Heckel; G. Rozenberg; G. Taentzer. Berlin : Springer, 2008. p. 321-335 10.1007/978-3-540-87405-8_22 (Lecture Notes in Computer Science; Vol. 5214, No. Supplement).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
TY - GEN
T1 - A Modal-Logic Based Graph Abstraction
AU - Bauer, J.
AU - Boneva, I.B.
AU - Kurban, M.E.
AU - Rensink, Arend
N1 - EATCS Award for the Best Theoretical Paper
PY - 2008
Y1 - 2008
N2 - Infinite or very large state spaces often prohibit the successful verification of graph transformation systems. Abstract graph transformation is an approach that tackles this problem by abstracting graphs to abstract graphs of bounded size and by lifting application of productions to abstract graphs. In this work, we present a new framework of abstractions unifying and generalising existing takes on abstract graph transformation. The precision of the abstraction can be adjusted according to the properties to be verified facilitating abstraction refinement. We present a modal logic defined on graphs, which is preserved and reflected by our abstractions. Finally, we demonstrate the usability of the framework by verifying a graph transformation model of a firewall.
AB - Infinite or very large state spaces often prohibit the successful verification of graph transformation systems. Abstract graph transformation is an approach that tackles this problem by abstracting graphs to abstract graphs of bounded size and by lifting application of productions to abstract graphs. In this work, we present a new framework of abstractions unifying and generalising existing takes on abstract graph transformation. The precision of the abstraction can be adjusted according to the properties to be verified facilitating abstraction refinement. We present a modal logic defined on graphs, which is preserved and reflected by our abstractions. Finally, we demonstrate the usability of the framework by verifying a graph transformation model of a firewall.
KW - IR-62461
KW - METIS-251183
KW - EWI-13439
U2 - 10.1007/978-3-540-87405-8_22
DO - 10.1007/978-3-540-87405-8_22
M3 - Conference contribution
SN - 978-3-540-87404-1
T3 - Lecture Notes in Computer Science
SP - 321
EP - 335
BT - International Conference on Graph Transformations (ICGT)
A2 - Ehrig, H
A2 - Heckel, R.
A2 - Rozenberg, G.
A2 - Taentzer, G.
PB - Springer
CY - Berlin
ER -