Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Logic in Computer Science

arXiv:1402.6459v4 (cs)
[Submitted on 26 Feb 2014 (v1), last revised 13 Sep 2014 (this version, v4)]

Title:A proof-theoretic view on scheduling in concurrency

Authors:Emmanuel Beffara (I2M)
View PDF
Abstract:This paper elaborates on a new approach of the question of the proof-theoretic study of concurrent interaction called "proofs as schedules". Observing that proof theory is well suited to the description of confluent systems while concurrency has non-determinism as a fundamental feature, we develop a correspondence where proofs provide what is needed to make concurrent systems confluent, namely scheduling. In our logical system, processes and schedulers appear explicitly as proofs in different fragments of the proof language and cut elimination between them does correspond to execution of a concurrent system. This separation of roles suggests new insights for the denotational semantics of processes and new methods for the translation of pi-calculi into prefix-less formalisms (like solos) as the operational counterpart of translations between proof systems.
Subjects: Logic in Computer Science (cs.LO)
Cite as: arXiv:1402.6459 [cs.LO]
  (or arXiv:1402.6459v4 [cs.LO] for this version)
  https://doi.org/10.48550/arXiv.1402.6459

Submission history

From: Emmanuel Beffara [view email] [via CCSD proxy]
[v1] Wed, 26 Feb 2014 09:09:41 UTC (25 KB)
[v2] Sun, 20 Apr 2014 19:29:12 UTC (30 KB)
[v3] Sun, 3 Aug 2014 19:29:31 UTC (31 KB)
[v4] Sat, 13 Sep 2014 12:38:44 UTC (34 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.LO
< prev   |   next >
new | recent | 2014-02
Change to browse by:
cs

References & Citations

DBLP - CS Bibliography

listing | bibtex
Emmanuel Beffara
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)