Local Reasoning for Parameterized First Order Protocols

03/07/2019
by   Rylo Ashmore, et al.
0

First Order Logic (FOL) is a powerful reasoning tool for program verification. Recent work on Ivy shows that FOL is well suited for verification of parameterized distributed systems. However, specifying many natural objects, such as a ring topology, in FOL is unexpectedly inconvenient. We present a framework based on FOL for specifying distributed multi-process protocols in a process-local manner together with an implicit network topology. In the specification framework, we provide an auto-active analysis technique to reason about the protocols locally, in a process-modular way. Our goal is to mirror the way designers often describe and reason about protocols. By hiding the topology behind the FOL structure, we simplify the modelling, but complicate the reasoning. To deal with that, we use an oracle for the topology to develop a sound and relatively complete proof rule that reduces reasoning about the implicit topology back to pure FOL. This completely avoids the need to axiomatize the topology. Using the rule, we establish a property that reduces verification to a fixed number of processes bounded by the size of local neighbourhoods. We show how to use the framework on two examples, including leader election on a ring.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/20/2019

Verification and Synthesis of Symmetric Uni-Rings for Leads-To Properties

This paper investigates the verification and synthesis of parameterized ...
research
05/17/2023

Verification of Population Protocols with Unordered Data is undecidable

We consider the new extension of population protocols with unordered dat...
research
08/30/2021

Population Protocols: Beyond Runtime Analysis

I survey our recent work on the verification of population protocols and...
research
11/04/2020

Probabilistic Bisimulation for Parameterized Systems (Technical Report)

Probabilistic bisimulation is a fundamental notion of process equivalenc...
research
10/19/2017

Paxos Made EPR: Decidable Reasoning about Distributed Protocols

Distributed protocols such as Paxos play an important role in many compu...
research
04/09/2020

Parameterized Reasoning for Distributed Systems with Consensus

Programmers make building distributed systems tractable by using a wide ...
research
03/06/2020

The Topology of Local Computing in Networks

Modeling distributed computing in a way enabling the use of formal metho...

Please sign up or login with your details

Forgot password? Click here to reset