=================================================
First International Workshop on Choreographic Programming co-located with PLDI 2024
One-day event, TBD within 24–28th of June 2024, Copenhagen, Denmark
https://pldi24.sigplan.org/home/cp-2024
Important dates
---------------
- Submission deadline: March 22nd, 2024 (AoE)
- Notification to authors: May 3rd, 2024 (AoE)
- Workshop day: TBD in week 26
Theme and Topics
----------------
Choreographies are coordination plans for concurrent and distributed systems, which define the roles of the involved participants and how they are supposed to work together. In the paradigm of choreographic programming (CP), choreographies are programs that can be compiled to executable implementations.
CP originated primarily in the context of process calculi, with preliminary work done to establish its foundations and experiment with implementations. Recently, several proposals have shown that one can adapt CP to work in synergy with mainstream programming paradigms, such as object-oriented and functional programming. These works substantiate the interest of a growing community of researchers and practitioners in evolving CP into a mature paradigm, able to improve the productivity and reliability of programming concurrent and distributed systems.
The aim of this workshop is to catalyse the community around CP by soliciting contributions in the following topics:
- Theory and models of choreographic programming.
- Design and implementation of choreographic programming languages, encompassing both standalone and library-based implementations.
- Design and implementation of runtime systems for choreographic programming.
- Verification and testing of choreographic programs.
- Type systems for choreographic languages.
- Interactions with software engineering (e.g., software requirements, design, construction, testing, analysis, and maintenance and software development methodologies).
- Fault tolerance and reliability in the context of choreographic programming.
- Synergies and comparisons with adjacent approaches for concurrent and distributed programming (e.g., multitier programming).
Contributions and Evaluation
----------------------------
Contributions can be work in progress, scientific work published or submitted for publication, tutorials, or practical experience reports.
Submissions should be no more than 6 pages excluding bibliography, using the ACM Proceedings format. Templates for Microsoft Word and LaTeX can be found at the SIGPLAN author information page.
Submissions will be evaluated following a lightweight double-blind review process.
For further details, refer to the workshop website and for any further queries, please contact the chairs.
Program Chairs
--------------
Saverio Giallorenzo, University of Bologna, IT (saverio.giallorenzo2@unibo.it)
Lindsey Kuper, University of California, Santa Cruz, US (lkuper@ucsc.edu)
Marco Peressotti, University of Southern Denmark, DK (peressotti@sdu.dk)
Program Committee
-----------------
Owen Arden, UC Santa Cruz, US
Marco Carbone, IT University of Copenhagen, DK
Ethan Cecchetti, University of Wisconsin-Madison, US
Luís Cruz-Filipe, University of Southern Denmark, DK
Eva Graversen, University of Southern Denmark, DK
Andrew K. Hirsch, University at Buffalo, SUNNY, US
Sung-Shik Jongmans, Open University of the Netherlands; CWI, NL
Ivan Lanese, University of Bologna, IT
Hugo A. López, Technical University of Denmark, DK
Rumyana Neykova, Brunel University London, UK
Larisa Safina, INRIA Lillle, FR
Guido Salvaneschi, University of St. Gallen, CH
Ian Sweet, Galois, Inc., US
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
