Rule Formats for Determinism and IdempotenceVisa övriga samt affilieringar
2012 (Engelska)Ingår i: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 77, s. 889-907Artikel i tidskrift (Refereegranskat) Published
Abstract [en]
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. © 2010 Elsevier B.V. All rights reserved.
Ort, förlag, år, upplaga, sidor
Amsterdam: Elsevier, 2012. Vol. 77, s. 889-907
Nyckelord [en]
Determinism, Idempotence, Rule formats, Structural operational semantics
Nationell ämneskategori
Data- och informationsvetenskap
Identifikatorer
URN: urn:nbn:se:hh:diva-20328DOI: 10.1016/j.scico.2010.04.002ISI: 000304179400008Scopus ID: 2-s2.0-84859778989OAI: oai:DiVA.org:hh-20328DiVA, id: diva2:583409
2013-01-082013-01-082018-01-11Bibliografiskt granskad