Rule formats for determinism and idempotence

L. Aceto, A. Birgisson, A. Ingólfsdóttir, M.R. Mousavi, M.A. Reniers

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

    8 Citations (Scopus)

    Abstract

    Determinism is a semantic property of (a fragment of) a language that specifies that a program cannot evolve operationally in several different ways. Idempotence is a property of binary composition operators requiring that the composition of two identical specifications or programs will result in a piece of specification or program that is equivalent to the original components. In this paper, we propose two (related) meta-theorems for guaranteeing determinism and idempotence of binary operators. These meta-theorems are formulated in terms of syntactic templates for operational semantics, called rule formats. We show the applicability of our formats by applying them to various operational semantics from the literature.
    Original languageEnglish
    Title of host publicationFundamentals of Software Engineering (Third IPM International Conference, FSEN 2009, Kish Island, Iran, April 15-17, 2009. Revised Selected Papers)
    EditorsF. Arbab, M. Sirjani
    Place of PublicationBerlin
    PublisherSpringer
    Pages146-161
    ISBN (Print)978-3-642-11622-3
    DOIs
    Publication statusPublished - 2010

    Publication series

    NameLecture Notes in Computer Science
    Volume5961
    ISSN (Print)0302-9743

    Fingerprint

    Dive into the research topics of 'Rule formats for determinism and idempotence'. Together they form a unique fingerprint.

    Cite this