Congruence for SOS with data (2004) [4 citations — 1 self]
Abstract:
While studying the specification of the operational semantics of different programming languages and formalisms, one can observe the following three facts. Firstly, Plotkin’s style of Structured Operational Semantics (SOS) has become a standard in defining operational semantics. Secondly, congruence with respect to some notion of bisimilarity is an interesting property for such languages and it is essential in reasoning about them. Thirdly, there are numerous languages that contain an explicit data part in the state of the operational semantics. The first two facts, have resulted in a line of research exploring syntactic formats of operational rules to derive the desired congruence property for free. However, the third point (in combination with the first two) is not sufficiently addressed and there is no standard congruence format for operational semantics with an explicit data state. In this paper, we address this problem by studying the implications of the presence of a data state on the notion of bisimilarity. Furthermore, we propose a number of formats for congruence. 1
Citations
| 155 | Bisimulation can’t be traced – Bloom, Istrail, et al. - 1995 |
| 110 | A congruence theorem for structured operational semantics with predicates and negative premises – Verhoef - 1995 |
| 65 | Structural operational semantics – Aceto, Fokkink, et al. - 1999 |
| 29 | Control Flow Semantics. Foundations of Computing Series – Bakker, Vink - 1996 |
| 28 | A congruence theorem for structural operational semantics of higher-order languages – Bernstein - 1998 |
| 12 | On the expressiveness of Linda-like concurrent languages – Brogi, Jacquet - 1998 |
| 3 | rule formats for parameterized and statebearing processes. Unpublished manuscript – SOS - 1995 |
| 2 | Baeten and Cornelis A. Middelburg. Process Algebra with Timing. EATCS Monographs – Jos - 2002 |
| 1 | Redesign of a systems engineering language — formalisation of χ – Bos, Kleijn - 2003 |
