EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Sitemap

Organisation

1317 Abstract Graph Transformation

Home Policy Brochure Browse Search User Area Contact Help

Rensink, A. and Distefano, D.S. (2006) Abstract Graph Transformation. In: Software Verification and Validation, 31 Oct 2005, Manchester. pp. 39-59. Electronic Notes in Theoretical Computer Science 157. Elsevier. ISSN 1571-0661

Full text available as:

PDF

- Univ. of Twente only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
519 Kb

Official URL: http://dx.doi.org/10.1016/j.entcs.2006.01.022

Abstract

Graphs may be used as representations of system states in operational semantics and model checking; in the latter context, they are being investigated as an alternative to bit vectors. The corresponding transitions are obtained as derivations from graph production rules.

In this paper we propose an abstraction technique in this framework: the state graphs are contracted by collecting nodes that are sufficiently similar (resulting in smaller states and a finite state space) and the application of the graph production rules is lifted to this abstract level. Since graph abstractions and rule applications can all be computed completely automatically, we believe that this can be the core of a practically feasible technique for software model checking.

Item Type:	Conference or Workshop Paper (Full Paper, Talk)
Research Group:	EWI-FMT: Formal Methods and Tools
Research Program:	CTIT-ASI: A-services Internet
Research Project:	GROOVE: Graphs for Object-Oriented Verification
Uncontrolled Keywords:	Software Model Checking, Graph Transformation, Abstract Interpretation
ID Code:	1317
Status:	Published
Deposited On:	18 May 2006
Refereed:	Yes
International:	Yes
More Information:	statistics metis

Export this item as:

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item