Rensink, A. and Zambon, Eduardo
Pattern-Based Graph Abstraction.
In: International Conference on Graph Transformation (ICGT 2012), 24-29 Sep 2012, Bremen, Germany.
Lecture Notes in Computer Science 7562.
Full text available as:
Official URL: http://dx.doi.org/10.1007/978-3-642-33654-6_5
We present a new abstraction technique for the exploration
of graph transformation systems with infinite state spaces. This technique is based on patterns, simple graphs describing structures of interest that should be preserved by the abstraction. Patterns are collected into pattern graphs, layered graphs that capture the hierarchical composition of smaller patterns into larger ones. Pattern graphs are then abstracted to a finite universe of pattern shapes by collapsing equivalent patterns. This paper shows how the application of production rules can be lifted to pattern shapes, resulting in an over-approximation of the original system behaviour and thus enabling verification on the abstract level.
|Item Type:||Conference or Workshop Paper (Full Paper, Talk)|
|Research Group:||EWI-FMT: Formal Methods and Tools|
|Research Program:||CTIT-DSN: Dependable Systems and Networks|
|Research Project:||GRAIL: Graphs for the Abstract Interpretation of Languages|
|Additional Information:||Winner of the EATCS Award for Best Paper of ICGT 2012|
|Uncontrolled Keywords:||Graph Transformation, Abstraction, Abstract Interpretation, State Space Exploration|
|Deposited On:||18 October 2012|
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item