Towards an Automatic Proof of the Bakery Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique
Communication Dans Un Congrès Année : 2023

Towards an Automatic Proof of the Bakery Algorithm

Résumé

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 sous embargo
Fichier sous embargo
1 2 4
Année Mois Jours
Avant la publication
jeudi 1 janvier 2026
Fichier sous embargo
jeudi 1 janvier 2026
Connectez-vous pour demander l'accès au fichier

Dates et versions

hal-04135287 , version 1 (20-06-2023)
hal-04135287 , version 2 (11-10-2024)

Licence

Identifiants

Citer

Aman Goel, Stephan Merz, Karem A. Sakallah. Towards an Automatic Proof of the Bakery Algorithm. 43th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2023, Lisbon, Portugal. pp.21-28, ⟨10.1007/978-3-031-35355-0_2⟩. ⟨hal-04135287v2⟩
31 Consultations
76 Téléchargements

Altmetric

Partager

More