EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Search
 Organisation

EEMCS EPrints Service


22348 Pattern-Based Graph Abstraction
Home Policy Brochure Browse Search User Area Contact Help

Rensink, A. and Zambon, Eduardo (2012) Pattern-Based Graph Abstraction. In: International Conference on Graph Transformation (ICGT 2012), 24-29 Sep 2012, Bremen, Germany. pp. 66-80. Lecture Notes in Computer Science 7562. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-33653-9

Full text available as:

PDF

340 Kb

Official URL: http://dx.doi.org/10.1007/978-3-642-33654-6_5

Abstract

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
ID Code:22348
Status:Published
Deposited On:18 October 2012
Refereed:Yes
International:Yes
More Information:statistics

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item