๐ฎ
๐ฎ
The Ethereal
Counter Simulations via Higher Order Quantifier Elimination: a preliminary report
December 05, 2017 ยท The Ethereal ยท ๐ International Workshop on Proof Exchange for Theorem Proving
"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 Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Logic in CS
๐ฎ
๐ฎ
The Ethereal
Safe Reinforcement Learning via Shielding
๐ฎ
๐ฎ
The Ethereal
Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks
๐ฎ
๐ฎ
The Ethereal
Heterogeneous substitution systems revisited
๐ฎ
๐ฎ
The Ethereal
Omega-Regular Objectives in Model-Free Reinforcement Learning
๐ฎ
๐ฎ
The Ethereal