Towards an Automatic Proof of the Bakery Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Towards an Automatic Proof of the Bakery Algorithm

Abstract

The Bakery algorithm is a landmark algorithm for ensuring mutual exclusion among N processes that communicate via shared variables. Starting from existing TLA+ specifications, we use the recently-developed IC3PO parameterized model checker to automatically compute inductive invariants for two versions of the algorithm. We compare the machine-generated invariants with human-written invariants that were used in an interactive correctness proof checked by the TLA+ Proof System. Our experience suggests that automated invariant inference is becoming a viable alternative to labor-intensive human-written proofs.
Fichier principal
Vignette du fichier
main.pdf (240.02 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Licence

Dates and versions

hal-04135287 , version 1 (20-06-2023)

Licence

Identifiers

Cite

Aman Goel, Stephan Merz, Karem A. Sakallah. Towards an Automatic Proof of the Bakery Algorithm. Formal Techniques for Distributed Objects, Components, and Systems. FORTE 2023., Jun 2023, Lisbon, Portugal. pp.21-28, ⟨10.1007/978-3-031-35355-0_2⟩. ⟨hal-04135287⟩
20 View
59 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More