Verified Parameterized Choreographies Technical Report

2025-02-21

AI Summary

Formal verification of parametric session contracts in dynamically scaled distributed systems remains an open challenge. Method: This paper introduces the first verifiable parametric session type theory, innovatively integrating parametric abstraction with endpoint projection rules to construct a process-calculus-based parametric orchestration language; its type system, projection algorithm, and semantics are fully formalized in Coq. Contributions: (1) A parametric session type definition supporting arbitrarily many dynamic participants; (2) Type-safe and deadlock-free projection rules; (3) Mechanized Coq proofs of both type safety and completeness of the projection. This work establishes, for the first time, end-to-end formal guarantees for session contracts in scenarios with infinitely many participants.

Technology Category

• Constraint Satisfaction and Optimization: Distributed CSP/Optimization
• Multiagent Systems: Agreement, Argumentation & Negotiation
• Planning, Routing, and Scheduling: Optimization of Spatio-temporal Systems

Application Category

• Systems and Infrastructure for Web, Mobile and WoT: Experiences and lessons learnt from Web-based algorithms and system deployments
• Security and Privacy: Large-scale security measurements
• Semantics and Knowledge: Provenance, trust, security and privacy, and ethical issues in managing semantic data

Abstract

This technical report contains the full set of definitions and projection rules of the paper ``Verified Parameterized Choreographies'' by Rubbens et al. It also supplements the artefact.

Problem

• Define parameterized choreographies formally
• Develop verified projection rules
• Supplement technical artefact details

Innovation

• Parameterized choreography verification
• Definition projection rules
• Supplementary artifact inclusion