Recent publications

  1. Kafle, B.; Gallagher, JP.; Gange, G.; Schachte, P.; Sondergaard, H.; Stuckey, PJ. An iterative approach to precondition inference using constrained Horn clauses. Theory and Practice of Logic Programming. CAMBRIDGE UNIV PRESS. 2018, Vol. 18, Issue 3-4, pp. 553-570. DOI: 10.1017/S1471068418000091
  2. Gallagher, JP.; Ajspur, M.; Kafle, B. Optimised determinisation and completion of finite tree automata. Journal of Logical and Algebraic Methods in Programming. 2018, Vol. 95, pp. 1-16. DOI: 10.1016/j.jlamp.2017.10.004
  3. Kafle, B.; Gallagher, JP.; Ganty, P. Tree dimension in verification of constrained Horn clauses. Theory and Practice of Logic Programming. 2018, Vol. 18, Issue 2, pp. 224-251. DOI: 10.1017/S1471068418000030
  4. Kafle, B.; Gange, G.; Schachte, P.; Sondergaard, H.; Stuckey, PJ. A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). SPRINGER INTERNATIONAL PUBLISHING AG. 2017, Vol. 10491, pp. 380-397. DOI: 10.1007/978-3-319-66263-3_24
  5. Kafle, B.; Gallagher, JP. Constraint specialisation in Horn clause verification. Science of Computer Programming. ELSEVIER SCIENCE BV. 2017, Vol. 137, pp. 125-140. DOI: 10.1016/j.scico.2017.01.002
  6. Kafle, B.; Gallagher, JP. Horn clause verification with convex polyhedral abstraction and tree automata-based refinement. Computer Languages, Systems & Structures. 2017, Vol. 47, pp. 2-18. DOI: 10.1016/j.cl.2015.11.001
  7. 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, pp. 278-286. DOI: 10.1016/j.micpro.2016.07.003
  8. Kafle, B.; Gallagher, JP. Interpolant tree automata and their application in Horn clause verification. Electronic Proceedings in Theoretical Computer Science. 2016, Vol. 216, pp. 104-117. DOI: 10.4204/EPTCS.216.6
  9. 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 International Publishing. 2016, Vol. 9779, pp. 261-268. DOI: 10.1007/978-3-319-41528-4_14
  10. Kafle, B.; Gallagher, JP.; Ganty, P. Solving non-linear Horn clauses using a linear Horn clause solver. Electronic Proceedings in Theoretical Computer Science. 2016, Vol. 219, pp. 33-48. DOI: 10.4204/EPTCS.219.4
  11. 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. ACM Press. 2015, pp. 85-90. DOI: 10.1145/2678015.2682544
  12. Kafle, B.; Gallagher, JP.; Ganty, P. Decomposition by tree dimension in Horn clause verification. Electronic Proceedings in Theoretical Computer Science. 2015, Vol. 199, pp. 1-14. DOI: 10.4204/EPTCS.199.1
  13. 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). SpringerLink. 2015, Vol. 8931, pp. 209-226.
  14. 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, pp. 53-67. DOI: 10.4204/EPTCS.169.7