Affiliation:
1. Grenoble Alps University, France / Savoie Mont Blanc University, France / CNRS, France / LAMA, France
Abstract
We propose a categorical framework for structural operational semantics, in which we prove that under suitable hypotheses bisimilarity is a congruence. We then refine the framework to prove soundness of bisimulation up to context, an efficient method for reducing the size of bisimulation relations. Finally, we demonstrate the flexibility of our approach by reproving known results in three variants of the π-calculus.
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Reference37 articles.
1. C. Berger, P.-A. Melliès, and M. Weber. 2012. Monads with arities and their associated theories. Journal of Pure and Applied Algebra 216, 8 (2012), 2029 – 2048.
2. Karen L. Bernstein. 1998. A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages. In Proc. 13th Symposium on Logic in Computer Science IEEE Computer Society, 153–164.
3. Bard Bloom, Sorin Istrail, and Albert R. Meyer. 1995. Bisimulation Can’t be Traced. Journal of the ACM 42, 1 (1995), 232–268.
4. Roland N. Bol and Jan Friso Groote. 1996. The Meaning of Negative Premises in Transition System Specifications. Journal of the ACM 43, 5 (1996), 863–914.
5. Filippo Bonchi, Daniela Petrişan, Damien Pous, and Jurriaan Rot. 2016. A general account of coinduction up-to. Acta Informatica (2016), 1–64.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Towards a Higher-Order Mathematical Operational Semantics;Proceedings of the ACM on Programming Languages;2023-01-09
2. A categorical framework for congruence of applicative bisimilarity in higher-order languages;Logical Methods in Computer Science;2022-09-21
3. Reduction monads and their signatures;Proceedings of the ACM on Programming Languages;2020-01
4. Cellular Monads from Positive GSOS Specifications;Electronic Proceedings in Theoretical Computer Science;2019-08-22