Follow
Bishoksan Kafle
Bishoksan Kafle
Research Fellow, The University of Melbourne, Australia
Verified email at unimelb.edu.au - Homepage
Title
Cited by
Cited by
Year
Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata
B Kafle, JP Gallagher, JF Morales
International Conference on Computer Aided Verification, 261-268, 2016
472016
Constraint specialisation in Horn clause verification
B Kafle, JP Gallagher
Proceedings of the 2015 Workshop on Partial Evaluation and Program …, 2015
302015
ENTRA: Whole-systems energy transparency
K Eder, JP Gallagher, P López-García, H Muller, Z Banković, K Georgiou, ...
Microprocessors and Microsystems 47, 278-286, 2016
242016
An iterative approach to precondition inference using constrained Horn clauses
B Kafle, JP Gallagher, G Gange, P Schachte, H Søndergaard, PJ Stuckey
Theory and Practice of Logic Programming 18 (3-4), 553-570, 2018
232018
Tree automata-based refinement with application to Horn clause verification
B Kafle, JP Gallagher
International Workshop on Verification, Model Checking, and Abstract …, 2015
212015
Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
B Kafle, JP Gallagher
Computer Languages, Systems & Structures 47, 2-18, 2017
182017
Solving non-linear Horn clauses using a linear Horn clause solver
B Kafle, JP Gallagher, P Ganty
arXiv preprint arXiv:1607.04459, 2016
142016
Analysis and transformation tools for constrained Horn clause verification
JP Gallagher, B Kafle
arXiv preprint arXiv:1405.3883, 2014
132014
From big-step to small-step semantics and back with interpreter specialisation
JP Gallagher, M Hermenegildo, B Kafle, M Klemen, PL García, J Morales
arXiv preprint arXiv:2008.02931, 2020
122020
An Otimised Algorithm for Determinisation and Completion of Finite Tree Automata
JP Gallagher, M Ajspur, B Kafle
Computer Science Research Report, 1-28, 2014
11*2014
Tree dimension in verification of constrained Horn clauses
B Kafle, JP Gallagher, P Ganty
Theory and Practice of Logic Programming 18 (2), 224-251, 2018
62018
A benders decomposition approach to deciding modular linear integer arithmetic
B Kafle, G Gange, P Schachte, H Søndergaard, PJ Stuckey
Theory and Applications of Satisfiability Testing–SAT 2017: 20th …, 2017
42017
Transformation-enabled precondition inference
B Kafle, G Gange, PJ Stuckey, P Schachte, H Søndergaard
Theory and Practice of Logic Programming 21 (6), 700-716, 2021
32021
Interpolant tree automata and their application in Horn clause verification
B Kafle, JP Gallagher
arXiv preprint arXiv:1601.06521, 2016
32016
Decomposition by tree dimension in Horn clause verification
B Kafle, JP Gallagher, P Ganty
arXiv preprint arXiv:1512.03862, 2015
32015
Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification
B Kafle, JP Gallagher
arXiv preprint arXiv:1412.1154, 2014
32014
Lightweight Nontermination Inference with CHCs
B Kafle, G Gange, P Schachte, H Søndergaard, PJ Stuckey
International Conference on Software Engineering and Formal Methods, 383-402, 2021
12021
A lightweight approach to nontermination inference using Constrained Horn Clauses
B Kafle, G Gange, P Schachte, H Søndergaard, PJ Stuckey
Software and Systems Modeling 23 (2), 319-342, 2024
2024
Regular path clauses and their application in solving loops
B Kafle, JP Gallagher, MV Hermenegildo, M Klemen, P López-García, ...
arXiv preprint arXiv:2109.04631, 2021
2021
Proceedings 8th Workshop on Horn Clauses for Verification and Synthesis
H Hojjat, B Kafle
arXiv preprint arXiv:2109.03988, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–20