Counter Simulations via Higher Order Quantifier Elimination: a preliminary report
Logic in Computer Science
2017-12-06 v1 Distributed, Parallel, and Cluster Computing
Software Engineering
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.
Cite
@article{arxiv.1712.01487,
title = {Counter Simulations via Higher Order Quantifier Elimination: a preliminary report},
author = {Silvio Ghilardi and Elena Pagani},
journal= {arXiv preprint arXiv:1712.01487},
year = {2017}
}
Comments
In Proceedings PxTP 2017, arXiv:1712.00898