Counter Simulations via Higher Order Quantifier Elimination: a preliminary report

December 05, 2017 ยท The Ethereal ยท ๐Ÿ› International Workshop on Proof Exchange for Theorem Proving

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Silvio Ghilardi, Elena Pagani arXiv ID 1712.01487 Category cs.LO: Logic in CS Cross-listed cs.DC, cs.SE Citations 3 Venue International Workshop on Proof Exchange for Theorem Proving Last Checked 5 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Logic in CS