Counter Simulations via Higher Order Quantifier Elimination: a preliminary report

12/05/2017
by   Silvio Ghilardi, et al.
0

Quite often, verification tasks for distributed systems are accomplished via counter abstractions. Such abstractions can sometimes be justified via simulations and bisimulations. In this work, we supply logical foundations to this practice, by a specifically designed technique for second order quantifier elimination. Our method, once applied to specifications of verification problems for parameterized distributed systems, produces integer variables systems that are ready to be model-checked by current SMT-based tools. We demonstrate the feasibility of the approach with a prototype implementation and first experiments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/25/2018

Quantifier Elimination for Database Driven Verification

Running verification tasks in database driven systems requires solving q...
research
10/08/2018

Defunctionalization of Higher-Order Constrained Horn Clauses

Building on the successes of satisfiability modulo theories (SMT), Bjørn...
research
06/05/2022

ACORN: Network Control Plane Abstraction using Route Nondeterminism

Networks are hard to configure correctly, and misconfigurations occur fr...
research
02/04/2023

Parameterized Verification under TSO with Data Types

We consider parameterized verification of systems executing according to...
research
08/18/2019

Taming Concurrency for Verification Using Multiparty Session Types (Technical Report)

The additional complexity caused by concurrently communicating processes...
research
08/16/2022

SAT-Inspired Higher-Order Eliminations

We generalize several propositional preprocessing techniques to higher-o...
research
06/16/2023

Fast Approximations of Quantifier Elimination

Quantifier elimination (qelim) is used in many automated reasoning tasks...

Please sign up or login with your details

Forgot password? Click here to reset