Logic in Computer Science (LICS 2004)

Paper: Congruence for SOS with Data (at LICS 2004)

Authors: MohammadReza Mousavi Michel Reniers Jan Friso Groote

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.

BibTeX

  @InProceedings{MousaviReniersGroot-CongruenceforSOSwit,
    author = 	 {MohammadReza Mousavi and Michel Reniers and Jan Friso Groote},
    title = 	 {Congruence for SOS with Data},
    booktitle =  {Proceedings of the Nineteenth Annual IEEE Symp. on Logic in Computer Science, {LICS} 2004},
    year =	 2004,
    editor =	 {Harald Ganzinger},
    month =	 {July}, 
    pages =      {303--312},
    location =   {Turku, Finland}, 
    publisher =	 {IEEE Computer Society Press}
  }