Cover Image

Ozone: Fully Out-of-Order Choreographies

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Plyukhin, Dan, Peressotti, Marco, Montesi, Fabrizio
Format:	Preprint
Published:	2024
Subjects:	Programming Languages
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Accompanist: A Runtime for Resilient Choreographic Programming
by: Kløvedal, Viktor Strate, et al.
Published: (2026)

A Promising Future: Omission Failures in Choreographic Programming
by: Graversen, Eva, et al.
Published: (2017)

Hennessy-Milner Logic in CSLib, the Lean Computer Science Library
by: Montesi, Fabrizio, et al.
Published: (2026)

A Conceptual Framework for API Refactoring in Enterprise Application Architectures
by: Montesi, Fabrizio, et al.
Published: (2024)

Real-World Choreographic Programming: Full-Duplex Asynchrony and Interoperability
by: Lugović, Lovro, et al.
Published: (2023)

Computer Science as Infrastructure: the Spine of the Lean Computer Science Library (CSLib)
by: Henson, Christopher, et al.
Published: (2026)

Towards a Higher-Order Bialgebraic Denotational Semantics
by: Goncharov, Sergey, et al.
Published: (2026)

A Probabilistic Choreography Language for PRISM
by: Carbone, Marco, et al.
Published: (2025)

On Propositional Dynamic Logic and Concurrency
by: Acclavio, Matteo, et al.
Published: (2024)

Type-Based Enforcement of Non-Interference for Choreographic Programming
by: Bertoni, Marco, et al.
Published: (2026)

Verified Parameterized Choreographies Technical Report
by: Rubbens, Robert, et al.
Published: (2025)

Chorex: Restartable, Language-Integrated Choreographies
by: Wiersdorf, Ashton, et al.
Published: (2025)

Choreographies as Macros
by: Bohosian, Alexander, et al.
Published: (2025)

Step in Tine: Forking Processes in Functional Choreographies
by: Samuelson, Ashley, et al.
Published: (2026)

Formulas as Processes, Deadlock-Freedom as Choreographies (Extended Version)
by: Acclavio, Matteo, et al.
Published: (2025)

CSLib: The Lean Computer Science Library
by: Barrett, Clark, et al.
Published: (2026)

Preventing Out-of-Gas Exceptions by Typing
by: Aceto, Luca, et al.
Published: (2024)

Hiord#: An Approach to the Specification and Verification of Higher-Order (C)LP Programs
by: Ciccalè, Marco, et al.
Published: (2025)

Fully Randomized Pointers
by: Phaye, Sai Dhawal, et al.
Published: (2024)

Fully Symbolic Analysis of Loop Locality: Using Imaginary Reuse to Infer Real Performance
by: Zhu, Yifan, et al.
Published: (2026)

Law and Order for Typestate with Borrowing
by: Saffrich, Hannes, et al.
Published: (2024)

HITrees: Higher-Order Interaction Trees
by: Ayyam, Amir Mohammad Fadaei, et al.
Published: (2025)

Higher-Order Behavioural Conformances via Fibrations
by: Urbat, Henning
Published: (2025)

SSA without Dominance for Higher-Order Programs
by: Leißa, Roland, et al.
Published: (2026)

Incremental Bidirectional Typing via Order Maintenance
by: Porter, Thomas J., et al.
Published: (2025)

Taming the Beast: Fully Automated Unit Testing with Coyote C++
by: Rho, Sanghoon, et al.
Published: (2024)

ILA: Correctness via Type Checking for Fully Homomorphic Encryption
by: Gollamudi, Tarakaram, et al.
Published: (2025)

Deterministic Fully-Static Whole-Binary Translation without Heuristics
by: Chen, Hongyu, et al.
Published: (2026)

Actegories, Copowers, and Higher-Order Message Passing Semantics
by: Cockett, Robin, et al.
Published: (2025)

Partial Orders for Precise and Efficient Dynamic Deadlock Prediction
by: Heuvel, Bas van den, et al.
Published: (2025)

Composing Automatic Differentiation with Custom Derivatives of Higher-Order Functions
by: Estep, Sam
Published: (2024)

Abstract Interpretation of Temporal Safety Effects of Higher Order Programs
by: Nicola, Mihai, et al.
Published: (2024)

Handling Higher-Order Effectful Operations with Judgemental Monadic Laws
by: Yang, Zhixuan, et al.
Published: (2025)

Hey Pentti, We Did It!: A Fully Vector-Symbolic Lisp
by: Tomkins-Flanagan, Eilene, et al.
Published: (2025)

Higher-Order Specifications for Deductive Synthesis of Programs with Pointers (Extended Version)
by: Young, David, et al.
Published: (2024)

Fully Automated Generation of Combinatorial Optimisation Systems Using Large Language Models
by: Karapetyan, Daniel
Published: (2025)

CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis
by: Tunç, Hünkar Can, et al.
Published: (2024)

Staged Specification Logic for Verifying Higher-Order Imperative Programs (Technical Report)
by: Foo, Darius, et al.
Published: (2023)

Higher Order Automatic Differentiation of Higher Order Functions
by: Huot, Mathieu, et al.
Published: (2021)

When Lifetimes Liberate: A Type System for Arenas with Higher-Order Reachability Tracking
by: He, Siyuan, et al.
Published: (2025)