## Foundations of Modular SOS (Extended Abstract) (1999)

Venue: | In MFCS'99, Proc. 24th Intl. Symp. on Mathematical Foundations of Computer Science, Szklarska-Poreba |

Citations: | 17 - 16 self |

### BibTeX

@INPROCEEDINGS{Mosses99foundationsof,

author = {Peter D. Mosses},

title = {Foundations of Modular SOS (Extended Abstract)},

booktitle = {In MFCS'99, Proc. 24th Intl. Symp. on Mathematical Foundations of Computer Science, Szklarska-Poreba},

year = {1999},

pages = {70--80},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

) Peter D. Mosses 1;2 1 BRICS and Department of Computer Science, University of Aarhus, Denmark 2 Visiting SRI International and Stanford University, USA Abstract. A novel form of labelled transition system is proposed, where the labels are the arrows of a category, and adjacent labels in computations are required to be composable. Such transition systems provide the foundations for modular SOS descriptions of programming languages. Three fundamental ways of transforming label categories, analogous to monad transformers, are provided, and it is shown that their applications preserve computations in modular SOS. The approach is illustrated with fragments taken from a modular SOS for ML concurrency primitives. 1 Introduction SOS (structural operational semantics) is a widely-used framework for defining process algebras [12, e.g.] and programming languages [13, e.g.]. Following Plotkin [22], SOS has often been preferred to the more abstract framework of denotational seman...

### Citations

1286 | A structural approach to operational semantics
- Plotkin
- 1981
(Show Context)
Citation Context ...ncurrency primitives. 1 Introduction SOS (structural operational semantics) is a widely-used framework for defining process algebras [12, e.g.] and programming languages [13, e.g.]. Following Plotkin =-=[22]-=-, SOS has often been preferred to the more abstract framework of denotational semantics. The labelled transition systems that provide the foundations for SOS are themselves well-studied mathematical o... |

605 | The Definition of Standard ML (Revised - Milner, Tofte, et al. - 1997 |

539 | A Syntactic Approach to Type Soundness
- Wright, Felleisen
- 1994
(Show Context)
Citation Context ...anguages. A non-structural but quite succinct approach to operational semantics is to give an (unlabelled) reduction semantics for applications of evaluation contexts C[t], following Felleisen et al. =-=[6, 29]-=-. The use of evaluation contexts appears to provide some inherent modularity, but obtaining full modularity may involve the introduction of many artificial internal steps [4]. Reppy's evaluation-conte... |

302 | Natural semantics
- Kahn
- 1987
(Show Context)
Citation Context ...rally corresponds to an indivisible item of information processing, such as adding two computed numbers, or assigning a computed number to a variable; in big-step SOS, also known as Natural Semantics =-=[11]-=-, a computation is a single transition leading directly to a terminal configuration, corresponding to the combination of many items of information processing. The two styles may be mixed in the same d... |

217 |
CML: A higher-order concurrent language
- Reppy
- 1991
(Show Context)
Citation Context ...sions below may be made in any order. 6.1 The Functional Fragment (excerpts) Exp e ::= v j x j e 1 e 2 j : : : Val v ::= c j (v 1 .v 2 ) j x(e) No label transformers are required here since we follow =-=[3, 25, 26]-=- and use syntactic substitution e[x 7! v] instead of environments and closures. e 1 ff \Gamma! e 0 1 e 1 e 2 ff \Gamma! e 0 1 e 2 e 2 ff \Gamma! e 0 2 v 1 e 2 ff \Gamma! v 1 e 0 2 (1) x(e) v ' \Gamma!... |

146 | Component-Based Semantics - Mosses - 2009 |

134 | G.: Towards a mathematical operational semantics
- Turi, Plotkin
- 1997
(Show Context)
Citation Context ...with new syntax and rules, rather than changes to labels. An SOS format with terms as labels has been proposed by Bernstein [2], but modularity was not considered. The recent work of Turi and Plotkin =-=[28]-=- using coalgebraic techniques in SOS addresses foundational issues, and appears not to improve the modularity of semantic descriptions; moreover, the approach does not yet seem to be applicable to the... |

133 | Semantics with Applications: A Formal Introduction
- Nielson, Nielson
- 1992
(Show Context)
Citation Context ...antics. The structural approach to operational semantics is particularly popular for describing both conventional programming languages and process algebras, and it is widely taught to undergraduates =-=[10, 21, 27]-=-. Its poor modularity was left as an open problem by Plotkin [22, p.64]. The approach proposed in the present paper provides modularity in SOS through the use of a more disciplined metanotation, while... |

125 | Higherâ€“Order Concurrency
- Reppy
- 1992
(Show Context)
Citation Context ...sions below may be made in any order. 6.1 The Functional Fragment (excerpts) Exp e ::= v j x j e 1 e 2 j : : : Val v ::= c j (v 1 .v 2 ) j x(e) No label transformers are required here since we follow =-=[3, 25, 26]-=- and use syntactic substitution e[x 7! v] instead of environments and closures. e 1 ff \Gamma! e 0 1 e 1 e 2 ff \Gamma! e 0 1 e 2 e 2 ff \Gamma! e 0 2 v 1 e 2 ff \Gamma! v 1 e 0 2 (1) x(e) v ' \Gamma!... |

123 | Operational and algebraic semantics of concurrent processes - Milner - 1990 |

83 |
Control operators, the SECD machine and the -calculus
- Felleisen, Friedman
- 1986
(Show Context)
Citation Context ...anguages. A non-structural but quite succinct approach to operational semantics is to give an (unlabelled) reduction semantics for applications of evaluation contexts C[t], following Felleisen et al. =-=[6, 29]-=-. The use of evaluation contexts appears to provide some inherent modularity, but obtaining full modularity may involve the introduction of many artificial internal steps [4]. Reppy's evaluation-conte... |

81 | A semantics for ML concurrency primitives
- Berry, Milner, et al.
- 1992
(Show Context)
Citation Context ...quite poor: when extending a pure functional language with concurrency primitives and/or references, for instance, the original specification of the transition rules had to be completely reformulated =-=[3]-=-. In denotational semantics, the problem of obtaining good modularity has received much attention, and has to a large extent been solved by introducing so-called monad transformers. Modular SOS, somew... |

74 |
The semantics of programming languages: an elementary introduction using structural operational semantics
- Hennessy
- 1990
(Show Context)
Citation Context ...antics. The structural approach to operational semantics is particularly popular for describing both conventional programming languages and process algebras, and it is widely taught to undergraduates =-=[10, 21, 27]-=-. Its poor modularity was left as an open problem by Plotkin [22, p.64]. The approach proposed in the present paper provides modularity in SOS through the use of a more disciplined metanotation, while... |

65 | The tile model
- Gadducci, Montanari
- 2000
(Show Context)
Citation Context ... structure of labels (which is a crucial step for obtaining full modularity and extensibility), nor did they consider partial composition of labels. The Tile Model framework of Gadducci and Montanari =-=[9]-=- provides categorical structure on labels, but is otherwise not closely related to the present approach. There has been extensive work on various formats of small-step SOS (see a recent paper by Fokki... |

55 |
Formal Syntax and Semantics of Programming Languages: A Laboratory-Based Approach
- Slonneger, Kurtz
- 1995
(Show Context)
Citation Context ...antics. The structural approach to operational semantics is particularly popular for describing both conventional programming languages and process algebras, and it is widely taught to undergraduates =-=[10, 21, 27]-=-. Its poor modularity was left as an open problem by Plotkin [22, p.64]. The approach proposed in the present paper provides modularity in SOS through the use of a more disciplined metanotation, while... |

54 | Ntyft/ntyxt rules reduce to ntree rules
- Fokkink, Glabbeek
- 1996
(Show Context)
Citation Context ...f control and computed values, and are therefore restricted to syntax and computed values 1 A more complicated definition is needed when negations of assertions of transitions are allowed in premises =-=[7]-=-. (i.e., value-added syntax, see Sect. 2). The transition relation is required to be ternary (fl ff \Gamma! fl 0 ), so the only place left for the usual semantic components of transitions (such as env... |

50 |
An Operational Semantics for CSP
- Plotkin
- 1983
(Show Context)
Citation Context ...dicating what remains to be done. Proofs, and some other details that have been omitted here, may be found in the full version of this paper [18]. 2 Conventional SOS In the conventional SOS framework =-=[22, 23]-=- programs (and all their constituent phrases) are generally modelled as labelled transition systems : Definition 1. A labelled transition system (LTS) is a structure (\Gamma; T ; A; \Gamma!), where \G... |

39 | Enhanced operational semantics
- Degano, Priami
(Show Context)
Citation Context ...ops ideas first explored by the author in [17]. The technique of incorporating all semantic information in labels has previously been proposed as a general principle for SOS also by Degano and Priami =-=[5]-=-, and exploited by them to obtain parametricity in the framework of Enhanced Operational Semantics. However, they did not abstract from the structure of labels (which is a crucial step for obtaining f... |

36 | A congruence theorem for structured operational semantics of higherorder languages
- Bernstein
- 1998
(Show Context)
Citation Context ...ferences), but the conservativity results obtained there concern extensions with new syntax and rules, rather than changes to labels. An SOS format with terms as labels has been proposed by Bernstein =-=[2]-=-, but modularity was not considered. The recent work of Turi and Plotkin [28] using coalgebraic techniques in SOS addresses foundational issues, and appears not to improve the modularity of semantic d... |

35 | Action Semantics. Number 26 - Mosses - 1992 |

32 | Extensible denotational language specifications
- Cartwright, Felleisen
- 1994
(Show Context)
Citation Context ...wing Felleisen et al. [6, 29]. The use of evaluation contexts appears to provide some inherent modularity, but obtaining full modularity may involve the introduction of many artificial internal steps =-=[4]-=-. Reppy's evaluation-context semantics for ML concurrency primitives [25, 26] has better modularity than the SOS given in [3]---see [20] for a detailed comparison of it with an MSOS for the same langu... |

31 | A conservative look at operational semantics with variable binding
- Fokkink, Verhoef
- 1998
(Show Context)
Citation Context ...orical structure on labels, but is otherwise not closely related to the present approach. There has been extensive work on various formats of small-step SOS (see a recent paper by Fokkink and Verhoef =-=[8]-=- for references), but the conservativity results obtained there concern extensions with new syntax and rules, rather than changes to labels. An SOS format with terms as labels has been proposed by Ber... |

31 | Theory and practice of action semantics - Mosses - 1996 |

29 | Foundations of modular sos
- Mosses
- 1999
(Show Context)
Citation Context ...hip of Modular SOS to other work. Section 8 concludes by indicating what remains to be done. Proofs, and some other details that have been omitted here, may be found in the full version of this paper =-=[18]-=-. 2 Conventional SOS In the conventional SOS framework [22, 23] programs (and all their constituent phrases) are generally modelled as labelled transition systems : Definition 1. A labelled transition... |

16 |
Inductive and operational semantics
- Astesiano
- 1991
(Show Context)
Citation Context ...e follow [3, 25, 26] and use syntactic substitution e[x 7! v] instead of environments and closures. e 1 ff \Gamma! e 0 1 e 1 e 2 ff \Gamma! e 0 1 e 2 e 2 ff \Gamma! e 0 2 v 1 e 2 ff \Gamma! v 1 e 0 2 =-=(1)-=- x(e) v ' \Gamma! e[x 7! v] (2) 6.2 An Imperative Extension (excerpts) Const c ::= : : : j assign j deref Val v ::= : : : j l The label transformer MutableInfo(store; Store) is used, where Store = Loc... |

12 |
A modular SOS for Action Notation (extended abstract
- Mosses
- 1999
(Show Context)
Citation Context ...defined using SOS [15, Apps. B--C]. The lack of modularity of that SOS has hindered the definition of extensions or variants of Action Notation. An MSOS of Action Notation has recently been developed =-=[19]-=-, and its modularity should greatly facilitate the reconsideration of the detailed design of Action Notation [16, Sect. 8]. The full MSOS descriptions of Action Notation and of ML concurrency primitiv... |

6 |
rewriting logic
- Semantics
- 1998
(Show Context)
Citation Context ...hannel k) with respective results e 1 and e 2 , as defined in [25, 26]. For instance, k!v k i k? with ((); v) holds. 7 Relation to Other Work This paper develops ideas first explored by the author in =-=[17]-=-. The technique of incorporating all semantic information in labels has previously been proposed as a general principle for SOS also by Degano and Priami [5], and exploited by them to obtain parametri... |

3 | Enhanced Operational Semantics for Concurrency. PhD thesis, Dipartimento di Informatica, Universit`a degli Studi di - Priami - 1996 |

1 |
A modular SOS for ML concurrency primitives. Draft, available from http://www.brics.dk/~pdm
- Mosses
- 1999
(Show Context)
Citation Context ... composition by the functors F and G, the desired property for computations follows. 6 Illustrative Examples The following fragments are taken from a complete Modular SOS of ML concurrency primitives =-=[20]-=-. Following [3], we describe first a purely functional fragment, and extend it both with references and with processes. In the original SOS, each extension involved a complete reformulation of the rul... |