Primitives for Contract-based Synchronization
Massimo Bartoletti (Dipartimento di Matematica e Informatica,, Universit\`a degli Studi di Cagliari), Roberto Zunino (Dipartimento di, Ingegneria e Scienza dell'Informazione, Universit\`a degli studi di Trento)
TL;DR
This paper introduces primitives for contract-based synchronization in concurrent systems, enabling modeling of interactions and expressing various concurrency models like pi-calculus and graph rewriting.
Contribution
It presents a novel set of primitives for multi-party synchronization via contracts and demonstrates their versatility by encoding different concurrency models.
Findings
Primitives effectively model contract-based interactions.
Encoding of pi-calculus and graph rewriting shows versatility.
Framework facilitates understanding of process interactions.
Abstract
We investigate how contracts can be used to regulate the interaction between processes. To do that, we study a variant of the concurrent constraints calculus presented in [1], featuring primitives for multi-party synchronization via contracts. We proceed in two directions. First, we exploit our primitives to model some contract-based interactions. Then, we discuss how several models for concurrency can be expressed through our primitives. In particular, we encode the pi-calculus and graph rewriting.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Formal Methods in Verification · Distributed systems and fault tolerance