Parameterized Verification of Topology-sensitive Distributed Protocols goes Declarative - Archive ouverte HAL Access content directly
Conference Papers Year :

Parameterized Verification of Topology-sensitive Distributed Protocols goes Declarative

(1, 2) , (3) , (3)
1
2
3

Abstract

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.
Fichier principal
Vignette du fichier
main-2.pdf (282.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02001652 , version 1 (31-01-2019)

Identifiers

  • HAL Id : hal-02001652 , version 1

Cite

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⟩
40 View
58 Download

Share

Gmail Facebook Twitter LinkedIn More