Rule formats for determinism and idempotence

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

    Research output: Contribution to journalArticleAcademicpeer-review

    7 Citations (Scopus)
    1 Downloads (Pure)

    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 (related) meta-theorems for guaranteeing the determinism and idempotence of binary operators. These meta-theorems are formulated in terms of syntactic templates for operational semantics, called rule formats. In order to obtain a powerful rule format for idempotence, we make use of the determinism of certain transition relations in the definition of the format for idempotence. We show the applicability of our formats by applying them to various operational semantics from the literature.
    Original languageEnglish
    Pages (from-to)889-907
    JournalScience of Computer Programming
    Volume77
    Issue number7-8
    DOIs
    Publication statusPublished - 2012

    Fingerprint

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

    Cite this