The Concurrent Calculi Formalisation Benchmark

Marco Carbone, David Castro-Perez, Francisco Ferreira, Lorenzo Gheri, Frederik Krogsdal Jacobsen, Alberto Momigliano, Luca Padovani, Alceste Scalas, Dawit Tirore, Martin Vassor, Nobuko Yoshida, Daniel Zackon

Research output: Contribution to conferencePaperpeer-review

Abstract

POPLMark and POPLMark Reloaded sparked a flurry of work on machine-checked proofs, and fostered the adoption of proof mechanisation in programming language research. Both challenges were purposely limited in scope, and they do not address concurrency-related issues. We propose a new collection of benchmark challenges focused on the difficulties that typically arise when mechanising formal models of concurrent and distributed programming languages, such as process calculi. Our benchmark challenges address three key topics: linearity, scope extrusion, and coinductive reasoning. The goal of this new benchmark is to clarify, compare, and advance the state of the art, fostering the adoption of proof mechanisation in future research on concurrency.
Original languageEnglish
Pages149-158
DOIs
Publication statusPublished - 11 Jun 2024
EventCOORDINATION 2024 - 26th International Conference on Coordination Models and Languages - Groningen, Netherlands
Duration: 18 Jun 202420 Jun 2024

Conference

ConferenceCOORDINATION 2024 - 26th International Conference on Coordination Models and Languages
Country/TerritoryNetherlands
CityGroningen
Period18/06/2420/06/24

Cite this