Difference between revisions of "Publications:Rule Formats for Determinism and Idempotence"

Latest revision as of 04:43, 26 June 2014

Title	Rule Formats for Determinism and Idempotence
Author	Luca Aceto and Arnar Birgisson and Anna Ingolfsdottir and Mohammad Reza Mousavi and Michel A. Reniers
Year	2012
PublicationType	Journal Paper
Journal	Science of Computer Programming
HostPublication
DOI	http://dx.doi.org/10.1016/j.scico.2010.04.002
Conference
Diva url	http://hh.diva-portal.org/smash/record.jsf?searchId=1&pid=diva2:583409
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. © 2010 Elsevier B.V. All rights reserved.