A formally verified SMT approach to true concurrency

Juliana Kuster Filipe Bowles, Marco Bright Caminati

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Downloads (Pure)


Many problems related to distributed and parallel systems, such as scheduling and optimisation, are computationally hard, thereby justifying the adoption of SMT solvers. The latter provide standard arithmetic as interpreted functions, naturally leading to express concurrent executions as a linearly-ordered sequentialisation (or interleaving) of events, which have an obvious correspondence with integer segments and therefore permit to take advantage of such arithmetical capabilities. However, there are alternative semantic approaches (also known as true concurrent) not imposing the extra step of interleaving events, which brings the question of how to computationally exploit SMT solvers inthese approaches. This paper presents a solution to this problem, and introduces a metric, made possible by adopting a true concurrent paradigm, which relates mutually distinct solutions of a family of distributed optimisation problems. We also contribute an original, computational definition of degree of parallelism, which we compare with the existing ones. Finally,we use theorem proving to formally certify a basic correctness property of our true concurrent approach.
Original languageEnglish
Title of host publicationProceedings of the 35th Italian Conference on Computational Logic - CILC 2020, Rende, Italy, October 13-15, 2020
EditorsFrancesco Calimeri, Simona Perri, Ester Zumpano
Publication statusPublished - 24 Oct 2020

Publication series

NameCEUR Workshop Proceedings
ISSN (Electronic)1613-0073


Dive into the research topics of 'A formally verified SMT approach to true concurrency'. Together they form a unique fingerprint.

Cite this