Defining Object-Oriented Execution Semantics Using Graph Transformations

H. Kastenberg, A.G. Kleppe, Arend Rensink

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

    30 Citations (Scopus)
    70 Downloads (Pure)

    Abstract

    In this paper we describe an application of the theory of graph transformations to the practise of language design. In particular, we have defined the static and dynamic semantics of a small but realistic object-oriented language (called TAAL) by mapping the language constructs to graphs (the static semantics) and modelling their effect by graph transformation rules (the dynamic semantics). This gives rise to execution models for all TAAL-programs, which can be used as the basis for formal verification. This work constitutes a first step towards a method for defining all aspects of software languages, besides their concrete syntax, in a consistent and rigorous manner. Such a method facilitates the integration of formal correctness in the software development trajectory.
    Original languageUndefined
    Title of host publicationProceedings of the 8th IFIP International Conference on Formal Methods for Open-Object Based Distributed Systems
    EditorsR. Gorrieri, H. Wehrheim
    Place of PublicationLondon
    PublisherSpringer
    Pages186-201
    Number of pages16
    ISBN (Print)978-3-540-34893-1
    DOIs
    Publication statusPublished - Jun 2006

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer Verlag
    Number2
    Volume4037
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Keywords

    • EWI-2803
    • METIS-238023
    • IR-65626

    Cite this