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

Publikation: Konference artikel i Proceeding eller bog/rapport kapitelBidrag til bog/antologiForskningpeer 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.
OriginalsprogEngelsk
TitelCoordination Models and Languages
Antal sider9
ForlagSpringer Nature Switzerland
Publikationsdato11 jun. 2024
Sider149-158
ISBN (Trykt)978-3-031-62696-8
ISBN (Elektronisk)978-3-031-62697-5
DOI
StatusUdgivet - 11 jun. 2024
NavnLecture Notes in Computer Science
Vol/bind14676

Fingeraftryk

Dyk ned i forskningsemnerne om 'The Concurrent Calculi Formalisation Benchmark'. Sammen danner de et unikt fingeraftryk.

Citationsformater