Rule formats for determinism and idempotence

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

    Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

    9 Citaten (Scopus)

    Samenvatting

    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.
    Originele taal-2Engels
    TitelFundamentals of Software Engineering (Third IPM International Conference, FSEN 2009, Kish Island, Iran, April 15-17, 2009. Revised Selected Papers)
    RedacteurenF. Arbab, M. Sirjani
    Plaats van productieBerlin
    UitgeverijSpringer
    Pagina's146-161
    ISBN van geprinte versie978-3-642-11622-3
    DOI's
    StatusGepubliceerd - 2010

    Publicatie series

    NaamLecture Notes in Computer Science
    Volume5961
    ISSN van geprinte versie0302-9743

    Vingerafdruk

    Duik in de onderzoeksthema's van 'Rule formats for determinism and idempotence'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit