A Modal-Logic Based Graph Abstraction


Bauer, J. and Boneva, I.B. and Kurban, M.E. and Rensink, A. (2008) A Modal-Logic Based Graph Abstraction. In: International Conference on Graph Transformations (ICGT), 9-13 Sep 2008, Leicester, UK (pp. pp. 321-335).

[img] PDF
Restricted to UT campus only
: Request a copy
Abstract: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.
Item Type:Conference or Workshop Item
Additional information:EATCS Award for the Best Theoretical Paper
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/62461
Official URL:https://doi.org/10.1007/978-3-540-87405-8_22
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 251183