| 11. |
- Aceto, Luca, et al.
(författare)
-
Rule formats for determinism and idempotence
- 2012
-
Ingår i: Science of Computer Programming. - Amsterdam : Elsevier BV. - 0167-6423 .- 1872-7964. ; 77:7-8, s. 889-907
-
Tidskriftsartikel (refereegranskat)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.
|
|
| 12. |
- Aceto, Luca, et al.
(författare)
-
Rule Formats for Distributivity
- 2012
-
Ingår i: Theoretical Computer Science. - : Elsevier BV. - 0304-3975 .- 1879-2294. ; 458, s. 1-28
-
Tidskriftsartikel (refereegranskat)abstract
- This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of left-distributivity laws from the literature are shown to be instances of the provided formats. Some conditions ensuring the invalidity of the left-distributivity law are also offered. © 2012 Elsevier B.V. All rights reserved.
|
|
| 13. |
- Aceto, Luca, et al.
(författare)
-
Rule Formats for Distributivity
- 2011
-
Ingår i: Language and Automata Theory and Applications. - Heidelberg : Springer Berlin/Heidelberg. - 9783642212536 ; , s. 79-90
-
Konferensbidrag (refereegranskat)abstract
- This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of left-distributivity laws from the literature are shown to be instances of the provided formats. © 2011 Springer-Verlag.
|
|
| 14. |
- Aceto, Luca, et al.
(författare)
-
Rule Formats for Distributivity
- 2010
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of left-distributivity laws from the literature are shown to be instances of the provided formats.
|
|
| 15. |
- Aceto, Luca, et al.
(författare)
-
SOS Rule Formats for Zero and Unit Elements
- 2011
-
Ingår i: Theoretical Computer Science. - Amsterdam : Elsevier. - 0304-3975 .- 1879-2294. ; 412:28, s. 3045-3071
-
Tidskriftsartikel (refereegranskat)abstract
- This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain constants act as left or right unit/zero elements for a set of binary operators. Examples of left and right zero, as well as unit, elements from the literature are shown to fit the rule formats offered in this study. © 2011 Elsevier B.V. All rights reserved.
|
|
| 16. |
|
|
| 17. |
-
Proceedings First International Workshop on Process Algebra and Coordination
- 2011
-
Proceedings (redaktörskap) (övrigt vetenskapligt/konstnärligt)abstract
- Process algebra provides abstract and rigorous means for studying communicating concurrent systems. Coordination languages also provide abstract means for the specifying and programming communication of components. Hence, the two fields seem to have very much in common and the link between these two research areas have been established formally by means of several translations, mainly from coordination languages to process algebras. There have also been proposals of process algebras whose communication policy is inspired by the one underlying coordination languages. The aim of this workshop was to push the state of the art in the study of the connections between process algebra and coordination languages by bringing together experts as well as young researchers from the two fields to communicate their ideas and findings. It includes both contributed and invited papers that have been presented during the one day meeting on Process Algebra and Coordination (PACO 2011) which took place on June 9, 2011 in Reykjavik, Iceland.
|
|
| 18. |
|
|
