A Formal Theory of Choreographic Programming

Luís Cruz-Filipe; Fabrizio Montesi; Marco Peressotti

doi:10.1007/s10817-023-09665-3

A Formal Theory of Choreographic Programming

Luís Cruz-Filipe^*, Fabrizio Montesi, Marco Peressotti

^*Corresponding author for this work

Research output: Contribution to journal › Journal article › Research › peer-review

44 Downloads (Pure)

Abstract

Choreographic programming is a paradigm for writing coordination plans for distributed systems from a global point of view, from which correct-by-construction decentralised implementations can be generated automatically. Theory of choreographies typically includes a number of complex results that are proved by structural induction. The high number of cases and the subtle details in some of these proofs has led to important errors being found in published works. In this work, we formalise the theory of a choreographic programming language in Coq. Our development includes the basic properties of this language, a proof of its Turing completeness, a compilation procedure to a process language, and an operational characterisation of the correctness of this procedure. Our formalisation experience illustrates the benefits of using a theorem prover: we get both an additional degree of confidence from the mechanised proof, and a significant simplification of the underlying theory. Our results offer a foundation for the future formal development of choreographic languages.

Original language	English
Article number	21
Journal	Journal of Automated Reasoning
Volume	67
Issue number	2
Number of pages	34
ISSN	0168-7433
DOIs	https://doi.org/10.1007/s10817-023-09665-3
Publication status	Published - May 2023

Bibliographical note

Funding Information:
The authors would like to thank the anonymous reviewers for their comments and suggestions, which contributed to increasing the quality of this article. This work was partially supported by Villum Fonden, grant nr 29518, and the Independent Research Fund Denmark, grant nr 0135-00219.

Keywords

Choreographic programming
Concurrency
Process calculi
Theorem proving

Documents & Links

10.1007/s10817-023-09665-3Licence: CC BY

Open Access VersionFinal published version, 1.28 MBLicence: CC BY

2 Article in proceedings

Certifying Choreography Compilation
Cruz-Filipe, L., Montesi, F. & Peressotti, M., 2021, Theoretical Aspects of Computing – ICTAC 2021 : 18th International Colloquium. Cerone, A. & Olveczky, P. C. (eds.). Springer Science+Business Media, p. 115-133 (Lecture Notes in Computer Science, Vol. 12819 LNCS).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Formalising a turing-complete choreographic language in Coq
Cruz-Filipe, L., Montesi, F. & Peressotti, M., 1. Jun 2021, 12th International Conference on Interactive Theorem Proving (ITP 2021). Cohen, L. & Kaliszyk, C. (eds.). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Vol. 193. p. 15:1-15:18 (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 193).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Open Access
File
28 Downloads (Pure)

Cite this

@article{a84ae6897b294162a968ba2e15eb50a5,

title = "A Formal Theory of Choreographic Programming",

abstract = "Choreographic programming is a paradigm for writing coordination plans for distributed systems from a global point of view, from which correct-by-construction decentralised implementations can be generated automatically. Theory of choreographies typically includes a number of complex results that are proved by structural induction. The high number of cases and the subtle details in some of these proofs has led to important errors being found in published works. In this work, we formalise the theory of a choreographic programming language in Coq. Our development includes the basic properties of this language, a proof of its Turing completeness, a compilation procedure to a process language, and an operational characterisation of the correctness of this procedure. Our formalisation experience illustrates the benefits of using a theorem prover: we get both an additional degree of confidence from the mechanised proof, and a significant simplification of the underlying theory. Our results offer a foundation for the future formal development of choreographic languages.",

keywords = "Choreographic programming, Concurrency, Process calculi, Theorem proving",

author = "Lu{\'i}s Cruz-Filipe and Fabrizio Montesi and Marco Peressotti",

note = "Funding Information: The authors would like to thank the anonymous reviewers for their comments and suggestions, which contributed to increasing the quality of this article. This work was partially supported by Villum Fonden, grant nr 29518, and the Independent Research Fund Denmark, grant nr 0135-00219. ",

year = "2023",

month = may,

doi = "10.1007/s10817-023-09665-3",

language = "English",

volume = "67",

journal = "Journal of Automated Reasoning",

issn = "0168-7433",

publisher = "Springer",

number = "2",

}

TY - JOUR

T1 - A Formal Theory of Choreographic Programming

AU - Cruz-Filipe, Luís

AU - Montesi, Fabrizio

AU - Peressotti, Marco

N1 - Funding Information: The authors would like to thank the anonymous reviewers for their comments and suggestions, which contributed to increasing the quality of this article. This work was partially supported by Villum Fonden, grant nr 29518, and the Independent Research Fund Denmark, grant nr 0135-00219.

PY - 2023/5

Y1 - 2023/5

N2 - Choreographic programming is a paradigm for writing coordination plans for distributed systems from a global point of view, from which correct-by-construction decentralised implementations can be generated automatically. Theory of choreographies typically includes a number of complex results that are proved by structural induction. The high number of cases and the subtle details in some of these proofs has led to important errors being found in published works. In this work, we formalise the theory of a choreographic programming language in Coq. Our development includes the basic properties of this language, a proof of its Turing completeness, a compilation procedure to a process language, and an operational characterisation of the correctness of this procedure. Our formalisation experience illustrates the benefits of using a theorem prover: we get both an additional degree of confidence from the mechanised proof, and a significant simplification of the underlying theory. Our results offer a foundation for the future formal development of choreographic languages.

AB - Choreographic programming is a paradigm for writing coordination plans for distributed systems from a global point of view, from which correct-by-construction decentralised implementations can be generated automatically. Theory of choreographies typically includes a number of complex results that are proved by structural induction. The high number of cases and the subtle details in some of these proofs has led to important errors being found in published works. In this work, we formalise the theory of a choreographic programming language in Coq. Our development includes the basic properties of this language, a proof of its Turing completeness, a compilation procedure to a process language, and an operational characterisation of the correctness of this procedure. Our formalisation experience illustrates the benefits of using a theorem prover: we get both an additional degree of confidence from the mechanised proof, and a significant simplification of the underlying theory. Our results offer a foundation for the future formal development of choreographic languages.

KW - Choreographic programming

KW - Concurrency

KW - Process calculi

KW - Theorem proving

U2 - 10.1007/s10817-023-09665-3

DO - 10.1007/s10817-023-09665-3

M3 - Journal article

AN - SCOPUS:85160450051

SN - 0168-7433

VL - 67

JO - Journal of Automated Reasoning

JF - Journal of Automated Reasoning

IS - 2

M1 - 21

ER -

A Formal Theory of Choreographic Programming

Abstract

Bibliographical note

Keywords

Documents & Links

Fingerprint

Related research output

Certifying Choreography Compilation

Formalising a turing-complete choreographic language in Coq

Cite this