Sökning: onr:"swepub:oai:research.chalmers.se:6d3f1c5a-2b25-4302-8c39-24cf1f5bb314" >
Rule formats for de...
Rule formats for determinism and idempotence
-
- Aceto, Luca (författare)
- Reykjavik University,ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS-101 Reykjavik, Iceland
-
- Birgisson, Arnar, 1981 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology,Department of Computer Science and Engineering, Chalmers University of Technology, Sweden
-
- Ingolfsdottir, Anna (författare)
- Reykjavik University,ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS-101 Reykjavik, Iceland
-
visa fler...
-
- Mousavi, MohammadReza (författare)
- Technische Universiteit Eindhoven,Eindhoven University of Technology
-
- Reniers, Michel A. (författare)
- Technische Universiteit Eindhoven,Eindhoven University of Technology,Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands
-
- Mousavi, Mohammad Reza (författare)
- Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands
-
visa färre...
-
(creator_code:org_t)
- Amsterdam : Elsevier BV, 2012
- 2012
- Engelska.
-
Ingår i: Science of Computer Programming. - Amsterdam : Elsevier BV. - 0167-6423 .- 1872-7964. ; 77:7-8, s. 889-907
- Relaterad länk:
-
http://dx.doi.org/10...
-
visa fler...
-
https://research.cha... (primary) (free)
-
https://doi.org/10.1...
-
https://doi.org/10.1...
-
https://research.cha...
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
Nyckelord
- Determinism
- Structural operational semantics
- Idempotence
- Rule formats
Publikations- och innehållstyp
- art (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas