Author:
Bjorner Nikolaj,Janota Mikolas
Abstract
We develop an algorithm for satisfiability of quantified formulas.The algorithm is based on recent progress in solving Quantified Boolean Formulas,but it generalizes beyond propositional logic to theories, such as linear arithmeticover integers (Presburger arithmetic), linear arithmetic over reals, algebraic data-types and arrays.Compared with previous algorithms for satisfiability of quantified arithmetical formulasour new implementation outperforms previous implementations in Z3 by a significant margin.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Optimised Complete Strategy for Testing Symbolic Finite State Machines;Fundamentals of Software Engineering;2023
2. Fast Approximations of Quantifier Elimination;Computer Aided Verification;2023
3. Recursion synthesis with unrealizability witnesses;Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2022-06-09
4. GenSys: a scalable fixed-point engine for maximal controller synthesis over infinite state spaces;Proceedings of the 29th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2021-08-18
5. Beyond the elementary representations of program invariants over algebraic data types;Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2021-06-18