Neighbourhood Abstraction in GROOVE

Share/Save/Bookmark

Rensink, Arend and Zambon, Eduardo (2011) Neighbourhood Abstraction in GROOVE. In: Fourth International Workshop on Graph-Based Tools, GraBaTs 2010, 28 September 2010, Enschede, NL.

[img] PDF
Restricted to UT campus only
: Request a copy
336kB
Abstract:Important classes of graph grammars have infinite 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 developed the theory of neighbourhood abstraction. In this paper, we present the implementation of this theory in GROOVE and illustrate its use with a small grammar that models operations on a single-linked list.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/76652
Official URL:http://journal.ub.tu-berlin.de/index.php/eceasst/article/view/501
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page