Work

Model Checking Graph Grammars

Year: 2003
Type: conference-paper
Abstract: We sketch a setup in which transition systems are generated from graph grammars andsubsequently 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 ofobject-oriented programs, thus enabling automatic verification of those programs. This paper describes work in progress.
Language: English
Open Access status: green
OpenAlex ID: W2785733129
FWCI: 5.388
Cites:
Cited by: 58
Related to: 10