Coinductive Big-Step Semantics for Concurrency
Abstract
In a paper presented at SOS 2010, we developed a framework for big-step semantics for interactive input-output in combination with divergence, based on coinductive and mixed inductive-coinductive notions of resumptions, evaluation and termination-sensitive weak bisimilarity. In contrast to standard inductively defined big-step semantics, this framework handles divergence properly; in particular, runs that produce some observable effects and then diverge, are not "lost". Here we scale this approach for shared-variable concurrency on a simple example language. We develop the metatheory of our semantics in a constructive logic.
- Publication:
-
arXiv e-prints
- Pub Date:
- December 2013
- DOI:
- 10.48550/arXiv.1312.2702
- arXiv:
- arXiv:1312.2702
- Bibcode:
- 2013arXiv1312.2702U
- Keywords:
-
- Computer Science - Programming Languages;
- Computer Science - Logic in Computer Science;
- F.3.2;
- F.1.2
- E-Print:
- In Proceedings PLACES 2013, arXiv:1312.2218