Model Checking Graph Grammars

Arend Rensink

Model Checking Graph Grammars

Arend Rensink

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

236 Downloads (Pure)

Abstract

We sketch a setup in which transition systems are generated from graph grammars and subsequently checked for properties expressed in a temporal logic on graphs. We envisage this as part of an approach where graph grammars are used to express the behavioural semantics of object-oriented programs, thus enabling automatic verification of those programs. This paper describes work in progress.

Original language	English
Title of host publication	Proceedings of the 3rd Automated Verification of Critical Systems (AVoCS’03)
Subtitle of host publication	April 2-3 2003, Southampton (GB)
Editors	Michael Leuschel, Stefan Gruner, Stéphane Lo Presti
Place of Publication	Southampton
Publisher	University of Southampton
Pages	150-160
Number of pages	11
Publication status	Published - 2003
Event	3rd Workshop on Automated Verification of Critical Systems, AVoCS 2003 - Southhampton, United Kingdom Duration: 2 Apr 2003 → 3 Apr 2003 Conference number: 3 http://users.ecs.soton.ac.uk/mal/avocs03/

Publication series

Name	Technical Report
Publisher	University of Southampton
Number	TR-2003-2
Volume	DSSE-TR-2003-02

Workshop

Workshop	3rd Workshop on Automated Verification of Critical Systems, AVoCS 2003
Abbreviated title	AVoCS
Country/Territory	United Kingdom
City	Southhampton
Period	2/04/03 → 3/04/03
Internet address	http://users.ecs.soton.ac.uk/mal/avocs03/

Keywords

METIS-215996
IR-63434
EWI-6922

Access to Document

Model Checking Graph GrammarsFinal published version, 155 KB

Cite this

Rensink, A. (2003). Model Checking Graph Grammars. In M. Leuschel, S. Gruner, & S. L. Presti (Eds.), Proceedings of the 3rd Automated Verification of Critical Systems (AVoCS’03): April 2-3 2003, Southampton (GB) (pp. 150-160). (Technical Report; Vol. DSSE-TR-2003-02, No. TR-2003-2). University of Southampton. http://users.ecs.soton.ac.uk/mal/avocs03/proceedings/21.ps

@inproceedings{49e35f53953e4b26a692acb8b8849cc4,

title = "Model Checking Graph Grammars",

abstract = "We sketch a setup in which transition systems are generated from graph grammars and subsequently checked for properties expressed in a temporal logic on graphs. We envisage this as part of an approach where graph grammars are used to express the behavioural semantics of object-oriented programs, thus enabling automatic verification of those programs. This paper describes work in progress.",

keywords = "METIS-215996, IR-63434, EWI-6922",

author = "Arend Rensink",

year = "2003",

language = "English",

series = "Technical Report",

publisher = "University of Southampton",

number = "TR-2003-2",

pages = "150--160",

editor = "Michael Leuschel and Stefan Gruner and Presti, \{St{\'e}phane Lo\}",

booktitle = "Proceedings of the 3rd Automated Verification of Critical Systems (AVoCS{\textquoteright}03)",

address = "United Kingdom",

note = "3rd Workshop on Automated Verification of Critical Systems, AVoCS 2003, AVoCS ; Conference date: 02-04-2003 Through 03-04-2003",

url = "http://users.ecs.soton.ac.uk/mal/avocs03/",

}

Rensink, A 2003, Model Checking Graph Grammars. in M Leuschel, S Gruner & SL Presti (eds), Proceedings of the 3rd Automated Verification of Critical Systems (AVoCS’03): April 2-3 2003, Southampton (GB). Technical Report, no. TR-2003-2, vol. DSSE-TR-2003-02, University of Southampton, Southampton, pp. 150-160, 3rd Workshop on Automated Verification of Critical Systems, AVoCS 2003, Southhampton, United Kingdom, 2/04/03. <http://users.ecs.soton.ac.uk/mal/avocs03/proceedings/21.ps>

Model Checking Graph Grammars. / Rensink, Arend.
Proceedings of the 3rd Automated Verification of Critical Systems (AVoCS’03): April 2-3 2003, Southampton (GB). ed. / Michael Leuschel; Stefan Gruner; Stéphane Lo Presti. Southampton: University of Southampton, 2003. p. 150-160 (Technical Report; Vol. DSSE-TR-2003-02, No. TR-2003-2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Model Checking Graph Grammars

AU - Rensink, Arend

N1 - Conference code: 3

PY - 2003

Y1 - 2003

N2 - We sketch a setup in which transition systems are generated from graph grammars and subsequently checked for properties expressed in a temporal logic on graphs. We envisage this as part of an approach where graph grammars are used to express the behavioural semantics of object-oriented programs, thus enabling automatic verification of those programs. This paper describes work in progress.

AB - We sketch a setup in which transition systems are generated from graph grammars and subsequently checked for properties expressed in a temporal logic on graphs. We envisage this as part of an approach where graph grammars are used to express the behavioural semantics of object-oriented programs, thus enabling automatic verification of those programs. This paper describes work in progress.

KW - METIS-215996

KW - IR-63434

KW - EWI-6922

M3 - Conference contribution

T3 - Technical Report

SP - 150

EP - 160

BT - Proceedings of the 3rd Automated Verification of Critical Systems (AVoCS’03)

A2 - Leuschel, Michael

A2 - Gruner, Stefan

A2 - Presti, Stéphane Lo

PB - University of Southampton

CY - Southampton

T2 - 3rd Workshop on Automated Verification of Critical Systems, AVoCS 2003

Y2 - 2 April 2003 through 3 April 2003

ER -

Model Checking Graph Grammars

Abstract

Publication series

Workshop

Keywords

Access to Document

Fingerprint

Cite this