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.
Counter simulations via higher order quantifier elimination : a preliminary report / S. Ghilardi, E. Pagani. - In: ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE. - ISSN 2075-2180. - 262(2017 Dec), pp. 39-53. ((Intervento presentato al 5. convegno Workshop on proof eXchange for theorem proving tenutosi a Brasilia (Brazil) nel 2017 [10.4204/EPTCS.262.5].
Counter simulations via higher order quantifier elimination : a preliminary report
S. Ghilardi;E. Pagani
2017
Abstract
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.File | Dimensione | Formato | |
---|---|---|---|
PxTP2017-PUBLISHED.pdf
accesso aperto
Descrizione: articolo completo - versione online su sito editore
Tipologia:
Publisher's version/PDF
Dimensione
234.93 kB
Formato
Adobe PDF
|
234.93 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.