Choice trees: Representing nondeterministic, recursive, and impure programs in coq

N Chappe, P He, L Henrio, Y Zakowski… - Proceedings of the ACM …, 2023 - dl.acm.org
This paper introduces ctrees, a monad for modeling nondeterministic, recursive, and impure
programs in Coq. Inspired by Xia et al.'s itrees, this novel data structure embeds …

Modular analysis of distributed hybrid systems using post-regions (full version)

E Kamburjan - arXiv preprint arXiv:2309.10470, 2023 - arxiv.org
We introduce a new approach to analyze distributed hybrid systems by a generalization of
rely-guarantee reasoning. First, we give a system for deductive verification of class …

Context-aware trace contracts

R Hähnle, E Kamburjan, M Scaletta - Active Object Languages: Current …, 2024 - Springer
The behavior of concurrent, asynchronous procedures depends in general on the call
context, because of the global protocol that governs scheduling. This context cannot be …

Compositional Correctness and Completeness for Symbolic Partial Order Reduction

ÅAA Kløvstad, E Kamburjan… - … on Concurrency Theory …, 2023 - drops.dagstuhl.de
Abstract Partial Order Reduction (POR) and Symbolic Execution (SE) are two fundamental
abstraction techniques in program analysis. SE is particularly useful as a state abstraction …

Provably fair cooperative scheduling

R Hähnle, L Henrio - arXiv preprint arXiv:2312.16977, 2023 - arxiv.org
The context of this work is cooperative scheduling, a concurrency paradigm, where task
execution is not arbitrarily preempted. Instead, language constructs exist that let a task …

[PDF][PDF] Choice trees

N Chappe, P He, L Henrio, Y Zakowski, S Zdancewic - 2023 - cis.upenn.edu
Authors' addresses: Nicolas Chappe, Univ Lyon, EnsL, UCBL, CNRS, Inria, LIP, F-69342,
LYON Cedex 07, France, nicolas. chappe@ ens-lyon. fr; Paul He, University of …

[PDF][PDF] Choice Trees: Representing and Reasoning About Nondeterministic, Recursive, and Impure Programs in Coq (draft)

N CHAPPE, P HE, L HENRIO, E IOANNIDIS… - perso.ens-lyon.fr
Abstract This paper introduces Choice Trees (CTrees), a monad for modeling
nondeterministic, recursive, and impure programs in Coq. Inspired by Xia et al.'s ITrees, this …

[引用][C] Choice Trees (draft)

N CHAPPE, P HE, L HENRIO, S ZDANCEWIC - 2018