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 |
Keywords
- METIS-215996
- IR-63434
- EWI-6922