Equality in lazy computation systems
Proceedings of the Fourth Annual Symposium on Logic in computer science
Structured operational semantics and bisimulation as a congruence
Information and Computation
A Calculus of Communicating Systems
A Calculus of Communicating Systems
The Tyft/Tyxt Format Reduces to Tree Rules
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Call-by-Push-Value: A Subsuming Paradigm
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
SOS for higher order processes
CONCUR 2005 - Concurrency Theory
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Implicit Propagation in Structural Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 8th international workshop on Specification and verification of component-based systems
Notions of bisimulation and congruence formats for SOS with data
Information and Computation
Modular semantics for transition system specifications with negative premises
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
For structural operational semantics (SOS) of process algebras, various notions of bisimulation have been studied, together with rule formats ensuring that bisimilarity is a congruence. For programming languages, however, SOS generally involves auxiliary entities (e.g. stores) and computed values, and the standard bisimulation and rule formats are not directly applicable. Here, we first introduce a notion of bisimulation based on the distinction between computations and values, with a corresponding liberal congruence format. We then provide metatheory for a modular variant of SOS (MSOS) which provides a systematic treatment of auxiliary entities. This is based on a higher order form of bisimulation, and we formulate an appropriate congruence format. Finally, we show how algebraic laws can be proved sound for bisimulation with reference only to the (M)SOS rules defining the programming constructs involved in them. Such laws remain sound for languages that involve further constructs.