Recent publications

  1. Kafle B, Gallagher JP. Horn clause verification with convex polyhedral abstraction and tree automata-based refinement. Computer Languages, Systems and Structures. 2017, Vol. 47.
  2. Eder K, Gallagher JP, López-García P, Muller H, Banković Z, Georgiou K, Haemmerlé R, Hermenegildo MV, Kafle B, Kerrison S, Kirkeby M, Klemen M, Li X, Liqat U, Morse J, Rhiger M, Rosendahl M. ENTRA: Whole-systems energy transparency. Microprocessors and Microsystems. 2016, Vol. 47.
  3. Kafle B, Gallagher JP. Interpolant tree automata and their application in Horn clause verification. Electronic Proceedings in Theoretical Computer Science, EPTCS. 2016, Vol. 216.
  4. Kafle B, Gallagher JP, Morales JF. RAHFT: A tool for verifying horn clauses using abstract interpretation and finite tree automata. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2016, Vol. 9779.
  5. Kafle B, Gallagher JP, Ganty P. Solving non-linear Horn clauses using a linear Horn clause solver. Electronic Proceedings in Theoretical Computer Science, EPTCS. 2016, Vol. 219.
  6. Kafle B, Gallagher JP. Constraint specialisation in horn clause verification. PEPM 2015 - Proceedings of the 2015 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, co-located with POPL 2015. 2015.
  7. Kafle B, Gallagher JP, Ganty P. Decomposition by tree dimension in Horn clause verification. Electronic Proceedings in Theoretical Computer Science, EPTCS. 2015, Vol. 199.
  8. Kafle B, Gallagher JP. Tree automata-based refinement with application to horn clause verification. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2015, Vol. 8931.
  9. Kafle B, Gallagher JP. Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification. Electronic Proceedings in Theoretical Computer Science, EPTCS. 2014, Vol. 169.