Abstract
In this paper we discuss the implementation of neighbourhood graph abstraction in the GROOVE tool set. Important classes of graph grammars may have unbounded state spaces and therefore cannot be verified with traditional model checking techniques. One way to address this problem is to perform graph abstraction, which allows us to generate a finite abstract state space that over-approximates the original one. In previous work we presented the theory of neighbourhood abstraction. In this paper, we present the implementation of this theory in GROOVE and illustrate its applicability with a case study that models a single-linked list.
Original language | Undefined |
---|---|
Title of host publication | Proceedings of the Fourth International Workshop on Graph-Based Tools (GraBaTs 2010) |
Editors | Juan de Lara, Daniel Varro |
Place of Publication | Enschede |
Publisher | Centre for Telematics and Information Technology (CTIT) |
Pages | 55-61 |
Number of pages | 6 |
Publication status | Published - Jun 2010 |
Event | Fourth International Workshop on Graph-Based Tools, GraBaTs 2010: Proceedings of the Fourth International Workshop on Graph-Based Tools (GraBaTs 2010) - University of Twente, Enschede, Netherlands Duration: 28 Sept 2010 → 28 Sept 2010 Conference number: 4 |
Publication series
Name | CTIT Workshop Proceedings |
---|---|
Publisher | Centre for Telematics and Information Technology University of Twente |
Number | WP 10-06 |
ISSN (Print) | 0929-0672 |
ISSN (Electronic) | 0929-0672 |
Conference
Conference | Fourth International Workshop on Graph-Based Tools, GraBaTs 2010 |
---|---|
Abbreviated title | GraBaTs 2010 |
Country/Territory | Netherlands |
City | Enschede |
Period | 28/09/10 → 28/09/10 |
Other | 28 September 2010 |
Keywords
- METIS-276081
- GROOVE
- Model Checking
- EWI-18316
- Graph Abstraction
- Graph Transformation
- IR-72606