CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Rule formats for determinism and idempotence

Luca Aceto ; Arnar Birgisson (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; Anna Ingolfsdottir ; MohammadReza Mousavi ; Michel A. Reniers
Science of Computer Programming (0167-6423). Vol. 77 (2012), 7-8, p. 889–907.
[Artikel, refereegranskad vetenskaplig]

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.

Nyckelord: Structural operational semantics, Rule formats, Determinism, Idempotence

Denna post skapades 2010-05-28. Senast ändrad 2012-07-02.
CPL Pubid: 122061


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)


Teoretisk datalogi

Chalmers infrastruktur