Local Reasoning about Parameterized Reconfigurable Distributed Systems - VERIMAG Accéder directement au contenu
Article Dans Une Revue Proceedings of the ACM on Programming Languages Année : 2022

Local Reasoning about Parameterized Reconfigurable Distributed Systems

Résumé

This paper presents a Hoare-style calculus for formal reasoning about reconfiguration programs of distributed systems. Such programs delete or create interactions or components while the system components change state according to their local behaviour. Our proof calculus uses a configuration logic that supports local reasoning and that relies on inductive predicates to describe distributed systems with an unbounded number of components. The validity of reconfiguration programs relies on havoc invariants, assertions about the ongoing interactions in the system. We present a proof system for such invariants in an assume/rely-guarantee style. We illustrate the feasibility of our approach by proving the correctness of self-adjustable tree architectures and provide tight complexity bounds for entailment checking in the configuration logic.
Fichier principal
Vignette du fichier
paper.pdf (786.29 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-03418999 , version 1 (08-11-2021)
hal-03418999 , version 2 (21-12-2022)

Licence

Domaine public

Identifiants

Citer

Emma Ahrens, Marius Bozga, Radu Iosif, Joost-Pieter Katoen. Local Reasoning about Parameterized Reconfigurable Distributed Systems. Proceedings of the ACM on Programming Languages, 2022, Issue OOPSLA2, 6 (130), pp.145-174. ⟨10.1145/3563293⟩. ⟨hal-03418999v2⟩
36 Consultations
34 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More