Parameterized Verification of Topology-sensitive Distributed Protocols goes Declarative

Sylvain Conchon (1, 2) , Giorgio Delzanno (3) , Angelo Ferrando (3)

1 LRI - Laboratoire de Recherche en Informatique
2 TOCCATA - Formally Verified Programs, Certified Tools and Numerical Computations
3 DIBRIS - Dipartimento di Informatica, Bioingegneria, Robotica e Ingegneria dei Sistemi [Genova]

We show that Cubicle, an SMT-based infinite-state model checker, can be applied as a verification engine for GLog, a logic-based specification language for topology-sensitive distributed protocols with asynchronous communication. Existential coverability queries in GLog can be translated into verification judgements in Cubicle by encoding relational updates rules as unbounded array transitions. We apply the resulting framework to automatically verify a distributed version of the Dining Philosopher mutual exclusion protocol formulated for an arbitrary number of nodes and communication buffers.

Domaines: Logique en informatique [cs.LO]

Sylvain Conchon, Giorgio Delzanno, Angelo Ferrando. Parameterized Verification of Topology-sensitive Distributed Protocols goes Declarative. International Conference on Networked Systems (NETYS), May 2018, Essaouira, Morocco. ⟨hal-02001652⟩