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. © 2010 Springer.
Cite
CITATION STYLE
Aceto, L., Birgisson, A., Ingolfsdottir, A., Mousavi, M., & Reniers, M. A. (2010). Rule formats for determinism and idempotence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5961 LNCS, pp. 146–161). https://doi.org/10.1007/978-3-642-11623-0_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
