Model Checking Graph Grammars

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    92 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 languageEnglish
    Title of host publicationProceedings of the 3rd Automated Verification of Critical Systems (AVoCS’03)
    Subtitle of host publicationApril 2-3 2003, Southampton (GB)
    EditorsMichael Leuschel, Stefan Gruner, Stéphane Lo Presti
    Place of PublicationSouthampton
    PublisherUniversity of Southampton
    Pages150-160
    Number of pages11
    Publication statusPublished - 2003
    Event3rd Workshop on Automated Verification of Critical Systems, AVoCS 2003 - Southhampton, United Kingdom
    Duration: 2 Apr 20033 Apr 2003
    Conference number: 3
    http://users.ecs.soton.ac.uk/mal/avocs03/

    Publication series

    NameTechnical Report
    PublisherUniversity of Southampton
    NumberTR-2003-2
    VolumeDSSE-TR-2003-02

    Workshop

    Workshop3rd Workshop on Automated Verification of Critical Systems, AVoCS 2003
    Abbreviated titleAVoCS
    CountryUnited Kingdom
    CitySouthhampton
    Period2/04/033/04/03
    Internet address

    Keywords

    • METIS-215996
    • IR-63434
    • EWI-6922

    Fingerprint

    Dive into the research topics of 'Model Checking Graph Grammars'. Together they form a unique fingerprint.

    Cite this