Corpus ID: 232269607

Zooid: a DSL for Certified Multiparty Computation

@article{CastroPerez2021ZooidAD,
  title={Zooid: a DSL for Certified Multiparty Computation},
  author={David Castro-Perez and Francisco Ferreira and Lorenzo Gheri and N. Yoshida},
  journal={ArXiv},
  year={2021},
  volume={abs/2103.10269}
}
Wedesign and implementZooid, a domain specific language for certified multiparty communication, embedded in Coq and implemented atop ourmechanisation framework of asynchronousmultiparty session types (the first of its kind).Zooid provides a fullymechanisedmetatheory for the semantics of global and local types, and a fully verified end-point process language that faithfully reflects the type-level behaviours and thus inherits the global types properties such as deadlock freedom, protocol… Expand
Zooid: a DSL for certified multiparty computation: from mechanised metatheory to certified multiparty processes
TLDR
Zooid provides a fully mechanised metatheory for the semantics of global and local types, and a fully verified end-point process language that faithfully reflects the type-level behaviours and thus inherits the global types properties such as deadlock freedom, protocol compliance, and liveness guarantees. Expand

References

SHOWING 1-10 OF 53 REFERENCES
Interaction trees: representing recursive and impure programs in Coq
TLDR
The termination-sensitive correctness of a compiler from a simple imperative source language to an assembly-like target whose meanings are given in an ITree-based denotational semantics is proved. Expand
The power of parameterization in coinductive proof
TLDR
This paper shows how to support coinductive proofs that are both compositional and incremental, using a dead simple construction the authors call the parameterized greatest fixed point, and presents the lattice-theoretic foundations of parameterized coinduction, and explores its mechanization in proof assistants like Coq and Isabelle. Expand
An introduction to small scale reflection in Coq
TLDR
This tutorial proposes a guided tour in some of the basic libraries distributed in the SSReflect package, which focuses on the application of the small scale reflection methodology to the formalization of finite objects in intuitionistic type theory. Expand
Multiparty Asynchronous Session Types
TLDR
The theory introduces a new notion of types in which interactions involving multiple peers are directly abstracted as a global scenario, and the fundamental properties of the session type discipline, such as communication safety, progress, and session fidelity, are established. Expand
Precise subtyping for synchronous multiparty sessions
TLDR
The novelty of this paper is the introduction of characteristic global types to prove the operational completeness of the subtyping for a synchronous multiparty session calculus. Expand
Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types
TLDR
The key property of the findings is the notion of multiparty compatibility which non-trivially extends the duality condition for binary session types. Expand
Using session types as an effect system
TLDR
It is shown that session types are expressive enough to encode an effect system for stateful processes, formalised via an effect-preserving encoding of a simple imperative language with an effects system into the pi-calculus with session primitives and session types. Expand
Actris: session-type based reasoning in separation logic
TLDR
It is shown that Actris provides a suitable level of abstraction by proving functional correctness of a variety of examples, including a distributed merge sort, a distributed load-balancing mapper, and a variant of the map-reduce model, using relatively simple specifications. Expand
Duality of Session Types: The Final Cut
TLDR
The competing definitions of duality for recursive types are compared, tradeoffs are discussed, and some equivalences are proved. Expand
EMTST: Engineering the Meta-theory of Session Types
TLDR
This work proposes a library that helps validate the theory of session types calculi in proof assistants, and develops a tool in the Coq proof assistant, using locally nameless for binders and small scale reflection to simplify the handling of linear typing environments. Expand
...
1
2
3
4
5
...