SOS formats and meta-theory : 20 years after
- M.R. Mousavi,
- ,
Output:
Contribution to journal
Article
Academic
Peer-reviewOpen access
Information
Output type
Output:
Contribution to journal
Article
Academic
Peer-reviewOriginal language
EnglishPages from-to (Number of pages)
Pages 238-272Journal (Volume, Issue Number)
Theoretical Computer Science (Volume 373, Issue 3)Publication milestones
- Published - 2007
Publication status
Published - 2007
ISSN
0304-3975Abstract
In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape [G.D. Plotkin, A structural approach to operational semantics, Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark, September 1981]. Subsequently, the format of SOS rules became the object of study. Using so-called Transition System Specifications (TSS’s) several authors syntactically restricted the format of rules and showed several useful properties about the semantics induced by any TSS adhering to the format. This has resulted in a line of research proposing several syntactical rule formats and associated meta-theorems. Properties that are guaranteed by such rule formats range from well-definedness of the operational semantics and compositionality of behavioral equivalences to security-, time- and probability-related issues. In this paper, we provide an overview of SOS rule formats and meta-theorems formulated around them.
Documents and Links
Metrics
Metrics
Download statistics
Download count
1
SciVal
FWCI
3.34
SciVal
Author count
3
SciVal
Paper percentile
93
SciVal
Top percentile
10
SciVal
citations
75
Scopus
citations
75
PlumX, opens in new tab
Captures
20
Citation count
75
