1. Tomáš Babiak , Mojmír Křetínský , Vojtěch Řehák , and Jan Strejček . 2012. LTL to Büchi Automata Translation: Fast and More Deterministic . In TACAS ’12 . Springer , 95–109. Tomáš Babiak, Mojmír Křetínský, Vojtěch Řehák, and Jan Strejček. 2012. LTL to Büchi Automata Translation: Fast and More Deterministic. In TACAS ’12. Springer, 95–109.
2. Thomas Ball and Sriram K . Rajamani . 2002 . The SLAM project: debugging system software via static analysis. In POPL ’02. ACM , 1–3. Thomas Ball and Sriram K. Rajamani. 2002. The SLAM project: debugging system software via static analysis. In POPL ’02. ACM, 1–3.
3. Ranking Functions for Linear-Constraint Loops
4. Tewodros A. Beyene , Corneliu Popeea , and Andrey Rybalchenko . 2013. Solving Existentially Quantified Horn Clauses . In CAV ’13 (LNCS , Vol. 8044). Springer, 869– 882 . Tewodros A. Beyene, Corneliu Popeea, and Andrey Rybalchenko. 2013. Solving Existentially Quantified Horn Clauses. In CAV ’13 (LNCS, Vol. 8044). Springer, 869–882.
5. Nikolaj Bjørner , Arie Gurfinkel , Kenneth L. McMillan , and Andrey Rybalchenko . 2015. Horn Clause Solvers for Program Verification . In Fields of Logic and Computation II: Essays Dedicated to Yuri Gurevich on the Occasion of His 75th Birthday (LNCS , Vol. 9300). Springer, 24– 51 . Nikolaj Bjørner, Arie Gurfinkel, Kenneth L. McMillan, and Andrey Rybalchenko. 2015. Horn Clause Solvers for Program Verification. In Fields of Logic and Computation II: Essays Dedicated to Yuri Gurevich on the Occasion of His 75th Birthday (LNCS, Vol. 9300). Springer, 24–51.