Cover Image

Synthesising Full-Information Protocols

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Berwanger, Dietmar, Doyen, Laurent, Soullard, Thomas
Format:	Preprint
Published:	2023
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Regular Games with Imperfect Information Are Not That Regular
by: Doyen, Laurent, et al.
Published: (2024)

Stochastic Processes with Expected Stopping Time
by: Chatterjee, Krishnendu, et al.
Published: (2021)

Algorithm and Strategy Construction for Sure-Almost-Sure Stochastic Parity Games
by: Doyen, Laurent, et al.
Published: (2026)

The Value Problem for Multiple-Environment MDPs with Parity Objective
by: Chatterjee, Krishnendu, et al.
Published: (2025)

Beyond Ability: The Four-Fold Spectrum of Power and the Logic of Full Inability
by: Wang, Shanxia
Published: (2026)

Bridging Computational Notions of Depth
by: Bienvenu, Laurent, et al.
Published: (2024)

Temporal Hyperproperties for Population Protocols
by: Waldburger, Nicolas, et al.
Published: (2024)

Full Definability in a Profunctorial Model
by: Tsukada, Takeshi, et al.
Published: (2026)

Proof Nets for PiL (Full Version)
by: Acclavio, Matteo, et al.
Published: (2026)

Mathematical Informatics: Algorithms
by: Seiller, Thomas
Published: (2026)

Efficient Synthesis of Symbolic Distributed Protocols by Sketching
by: Egolf, Derek, et al.
Published: (2024)

Wait-Only Broadcast Protocols are Easier to Verify
by: Guillou, Lucie, et al.
Published: (2025)

Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
by: Powell, Thomas
Published: (2023)

Unification of Deterministic Higher-Order Patterns (Full Version)
by: Niederhauser, Johannes, et al.
Published: (2026)

A Hoare Logic for Domain Specification (Full Version)
by: Kamburjan, Eduard, et al.
Published: (2024)

Accelerating Protocol Synthesis and Detecting Unrealizability with Interpretation Reduction
by: Egolf, Derek, et al.
Published: (2025)

Testing Uniform Random Samplers: Methods, Datasets and Protocols
by: Zeyen, Olivier, et al.
Published: (2025)

Confluence Criteria for Logically Constrained Rewrite Systems (Full Version)
by: Schöpf, Jonas, et al.
Published: (2023)

Localized Attractor Computations for Infinite-State Games (Full Version)
by: Schmuck, Anne-Kathrin, et al.
Published: (2024)

Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests
by: Bogaerts, Bart, et al.
Published: (2022)

Modular Attractor Acceleration in Infinite-State Games (Full Version)
by: Heim, Philippe, et al.
Published: (2026)

Revisiting the Fast Fourier Transform in Rocq
by: Théry, Laurent
Published: (2022)

Knowledge Problems in Protocol Analysis: Extending the Notion of Subterm Convergent
by: Bunch, Carter, et al.
Published: (2024)

Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
by: Balasubramanian, A. R., et al.
Published: (2020)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)

Equational Theories and Validity for Logically Constrained Term Rewriting (Full Version)
by: Aoto, Takahito, et al.
Published: (2024)

Recovering Commutation of Logically Constrained Rewriting and Equivalence Transformations (Full Version)
by: Takahata, Kanta, et al.
Published: (2025)

Partial Rewriting and Value Interpretation of Logically Constrained Terms (Full Version)
by: Aoto, Takahito, et al.
Published: (2026)

Counterexample-Guided Abstraction Refinement for Generalized Graph Transformation Systems (Full Version)
by: König, Barbara, et al.
Published: (2025)

Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

Translation of Temporal Logic for Efficient Infinite-State Reactive Synthesis (Full Version)
by: Heim, Philippe, et al.
Published: (2024)

Difference of Constrained Patterns in Logically Constrained Term Rewrite Systems (Full Version)
by: Nishida, Naoki, et al.
Published: (2025)

Consistent Update Synthesis via Privatized Beliefs
by: Schlögl, Thomas, et al.
Published: (2024)

Existential and positive games: a comonadic and axiomatic view
by: Abramsky, Samson, et al.
Published: (2025)

Deductive Verification of Weak Memory Programs with View-based Protocols (extended version)
by: Şakar, Ömer, et al.
Published: (2026)

Concrete Security Bounds for Simulation-Based Proofs of Multi-Party Computation Protocols
by: Sojakova, Kristina, et al.
Published: (2025)

Modal Logic for Reasoning About Uncertainty and Confusion
by: Bílková, Marta, et al.
Published: (2025)

From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
by: Kassing, Jan-Christoph, et al.
Published: (2024)

The Computability Path Order for Beta-Eta-Normal Higher-Order Rewriting (Full Version)
by: Niederhauser, Johannes, et al.
Published: (2025)

Characterizing Equivalence of Logically Constrained Terms via Existentially Constrained Terms (Full Version)
by: Takahata, Kanta, et al.
Published: (2025)