Skip to main navigation Skip to search Skip to main content

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: Conference Article in Proceeding or Book/Report chapterBook chapterResearchpeer-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
Title of host publicationCoordination Models and Languages
Number of pages9
PublisherSpringer Nature Switzerland
Publication date11 Jun 2024
Pages149-158
ISBN (Print)978-3-031-62696-8
ISBN (Electronic)978-3-031-62697-5
DOIs
Publication statusPublished - 11 Jun 2024
SeriesLecture Notes in Computer Science
Volume14676

Keywords

  • Mechanisation
  • Process calculi
  • Benchmark
  • Linearity
  • Scope extrusion
  • Coinduction

Fingerprint

Dive into the research topics of 'The Concurrent Calculi Formalisation Benchmark'. Together they form a unique fingerprint.

Cite this