Horn clause verification with convex polyhedral abstraction and tree automata-based refinement. J. Computer Languages, Systems & Structures. 46. 2016.
Interpolant tree automata and their application in Horn clause verification. Theoretical Computer Science - EPTCS. 216:104-117.. 2016.
Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata. 28th International Conference Computer Aided Verification - CAV 2016. :261-268.. 2016.
Solving non-linear Horn clauses using a linear Horn clause solver. Electronic Proceedings in Theoretical Computer Science. 219:33-48.. 2016.