Formulas as Processes, Deadlock-Freedom as Choreographies (Extended Version)
Fuente:
arXiv
Saved in:
| Main Authors: | Acclavio, Matteo, Manara, Giulia, Montesi, Fabrizio |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Proof Nets for PiL (Full Version)
by: Acclavio, Matteo, et al.
Published: (2026)
by: Acclavio, Matteo, et al.
Published: (2026)
Proofs as Execution Trees for the π-Calculus
by: Acclavio, Matteo, et al.
Published: (2024)
by: Acclavio, Matteo, et al.
Published: (2024)
On Propositional Dynamic Logic and Concurrency
by: Acclavio, Matteo, et al.
Published: (2024)
by: Acclavio, Matteo, et al.
Published: (2024)
Probabilistic Linear Logic Programming with an Application to Bayesian Network Computations (Extended Version)
by: Acclavio, Matteo, et al.
Published: (2026)
by: Acclavio, Matteo, et al.
Published: (2026)
Intuitionistic BV (Extended version)
by: Acclavio, Matteo, et al.
Published: (2025)
by: Acclavio, Matteo, et al.
Published: (2025)
Graphical Proof Theory I: Sequent Systems on Undirected Graphs
by: Acclavio, Matteo
Published: (2023)
by: Acclavio, Matteo
Published: (2023)
Logic Programming with Multiplicative Structures
by: Acclavio, Matteo, et al.
Published: (2024)
by: Acclavio, Matteo, et al.
Published: (2024)
Proof Identity and Categorical Models of BV
by: Acclavio, Matteo, et al.
Published: (2026)
by: Acclavio, Matteo, et al.
Published: (2026)
Non-wellfounded parsimonious proofs and non-uniform complexity
by: Acclavio, Matteo, et al.
Published: (2024)
by: Acclavio, Matteo, et al.
Published: (2024)
Infinitary Cut-Elimination for Non-Wellfounded Parsimonious Linear Logic
by: Acclavio, Matteo, et al.
Published: (2023)
by: Acclavio, Matteo, et al.
Published: (2023)
Computer Science as Infrastructure: the Spine of the Lean Computer Science Library (CSLib)
by: Henson, Christopher, et al.
Published: (2026)
by: Henson, Christopher, et al.
Published: (2026)
Asynchronous Session-Based Concurrency: Deadlock-freedom in Cyclic Process Networks
by: Heuvel, Bas van den, et al.
Published: (2021)
by: Heuvel, Bas van den, et al.
Published: (2021)
Hennessy-Milner Logic in CSLib, the Lean Computer Science Library
by: Montesi, Fabrizio, et al.
Published: (2026)
by: Montesi, Fabrizio, et al.
Published: (2026)
Non-Deterministic Functions as Non-Deterministic Processes (Extended Version)
by: Paulus, Joseph W. N., et al.
Published: (2021)
by: Paulus, Joseph W. N., et al.
Published: (2021)
JAX Autodiff from a Linear Logic Perspective (Extended Version)
by: Giusti, Giulia, et al.
Published: (2025)
by: Giusti, Giulia, et al.
Published: (2025)
A Probabilistic Choreography Language for PRISM
by: Carbone, Marco, et al.
Published: (2025)
by: Carbone, Marco, et al.
Published: (2025)
Deadlock in packet switching networks
by: Stramaglia, Anna, et al.
Published: (2021)
by: Stramaglia, Anna, et al.
Published: (2021)
Sharing and Linear Logic with Restricted Access (Extended Version)
by: Barenbaum, Pablo, et al.
Published: (2025)
by: Barenbaum, Pablo, et al.
Published: (2025)
First-Order LTLf Synthesis with Lookback (Extended Version)
by: Winkler, Sarah
Published: (2025)
by: Winkler, Sarah
Published: (2025)
A Hyperlogic for Strategies in Stochastic Games (Extended Version)
by: Gerlach, Lina, et al.
Published: (2025)
by: Gerlach, Lina, et al.
Published: (2025)
Practical Deductive Verification of OCaml Programs (Extended Version)
by: Pereira, Mário
Published: (2024)
by: Pereira, Mário
Published: (2024)
Towards Proving Liveness on Weak Memory (Extended Version)
by: Bargmann, Lara, et al.
Published: (2026)
by: Bargmann, Lara, et al.
Published: (2026)
Satisfiability Modulo Extensional Constant Arrays (Extended Version)
by: Preiner, Mathias, et al.
Published: (2026)
by: Preiner, Mathias, et al.
Published: (2026)
Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory [Extended Version]
by: Kettmann, Pascal, et al.
Published: (2026)
by: Kettmann, Pascal, et al.
Published: (2026)
Efficient Probabilistic Model Checking for Relational Reachability (Extended Version)
by: Gerlach, Lina, et al.
Published: (2025)
by: Gerlach, Lina, et al.
Published: (2025)
Certified Branch-and-Bound MaxSAT Solving (Extended Version)
by: Vandesande, Dieter, et al.
Published: (2025)
by: Vandesande, Dieter, et al.
Published: (2025)
Equational Reasoning Modulo Commutativity in Languages with Binders (Extended Version)
by: Caires-Santos, Ali K., et al.
Published: (2025)
by: Caires-Santos, Ali K., et al.
Published: (2025)
Model Checking as Program Verification by Abstract Interpretation (Extended Version)
by: Baldan, Paolo, et al.
Published: (2025)
by: Baldan, Paolo, et al.
Published: (2025)
Partially Finite Model Reasoning in Description Logics Extended Version
by: Gogacz, Tomasz, et al.
Published: (2026)
by: Gogacz, Tomasz, et al.
Published: (2026)
A Framework for Coalgebraic Reward-Sensitive Bisimulation (Extended Version)
by: de Amorim, Pedro H. Azevedo, et al.
Published: (2026)
by: de Amorim, Pedro H. Azevedo, et al.
Published: (2026)
Mechanized Undecidability of Higher-order beta-Matching (Extended Version)
by: Dudenhefner, Andrej
Published: (2026)
by: Dudenhefner, Andrej
Published: (2026)
Static and Dynamic Verification of OCaml Programs: The Gospel Ecosystem (Extended Version)
by: Soares, Tiago Lopes, et al.
Published: (2024)
by: Soares, Tiago Lopes, et al.
Published: (2024)
From Thin Concurrent Games to Generalized Species of Structures (Extended Version)
by: Clairambault, Pierre, et al.
Published: (2023)
by: Clairambault, Pierre, et al.
Published: (2023)
A set-theoretical approach for ABox reasoning services (Extended Version)
by: Cantone, Domenico, et al.
Published: (2017)
by: Cantone, Domenico, et al.
Published: (2017)
Weak Simplicial Bisimilarity for Polyhedral Models and SLCS_eta -- Extended Version
by: Bezhanishvili, Nick, et al.
Published: (2024)
by: Bezhanishvili, Nick, et al.
Published: (2024)
Ordered Adjoint Logic (Extended Version)
by: Roshal, Sophia, et al.
Published: (2026)
by: Roshal, Sophia, et al.
Published: (2026)
Adjoint Natural Deduction (Extended Version)
by: Jang, Junyoung, et al.
Published: (2024)
by: Jang, Junyoung, et al.
Published: (2024)
Concrete Domains Meet Expressive Cardinality Restrictions in Description Logics (Extended Version)
by: Baader, Franz, et al.
Published: (2025)
by: Baader, Franz, et al.
Published: (2025)
The Shape of $\mathcal{EL}$ Proofs: A Tale of Three Calculi (Extended Version)
by: Alrabbaa, Christian, et al.
Published: (2025)
by: Alrabbaa, Christian, et al.
Published: (2025)
Guarded Fragments Meet Dynamic Logic: The Story of Regular Guards (Extended Version)
by: Bednarczyk, Bartosz, et al.
Published: (2025)
by: Bednarczyk, Bartosz, et al.
Published: (2025)
Similar Items
-
Proof Nets for PiL (Full Version)
by: Acclavio, Matteo, et al.
Published: (2026) -
Proofs as Execution Trees for the π-Calculus
by: Acclavio, Matteo, et al.
Published: (2024) -
On Propositional Dynamic Logic and Concurrency
by: Acclavio, Matteo, et al.
Published: (2024) -
Probabilistic Linear Logic Programming with an Application to Bayesian Network Computations (Extended Version)
by: Acclavio, Matteo, et al.
Published: (2026) -
Intuitionistic BV (Extended version)
by: Acclavio, Matteo, et al.
Published: (2025)