Process-Algebraic Models of Multi-Writer Multi-Reader Non-Atomic Registers

07/11/2023
by   Myrthe Spronck, et al.
0

We present process-algebraic models of multi-writer multi-reader safe, regular and atomic registers. We establish the relationship between our models and alternative versions presented in the literature. We use our models to formally analyse by model checking to what extent several well-known mutual exclusion algorithms are robust for relaxed atomicity requirements. Our analyses refute correctness claims made about some of these algorithms in the literature.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/01/2021

On the (Non-)Applicability of a Small Model Theorem to Model Checking STMs

Software Transactional Memory (STM) algorithms provide programmers with ...
research
02/24/2022

Practical Abstraction for Model Checking of Multi-Agent Systems

Model checking of multi-agent systems (MAS) is known to be hard, both th...
research
04/21/2021

Tutorial: Designing Distributed Software in mCRL2

Distributed software is very tricky to implement correctly as some error...
research
02/02/2021

Fast Parametric Model Checking through Model Fragmentation

Parametric model checking (PMC) computes algebraic formulae that express...
research
07/23/2019

Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space

The paper details the first successful attempt at using model-checking t...
research
01/22/2020

Fine-grained Analysis on Fast Implementations of Multi-writer Atomic Registers

This draft in its current version proves an impossibility result concern...
research
07/23/2023

Robustness, model checking and latent Gaussian models

Model checking is essential to evaluate the adequacy of statistical mode...

Please sign up or login with your details

Forgot password? Click here to reset