Analysis and Transformation Tools for Constrained Horn Clause Verification. - John P. Gallagher; Bishoksan Kafle (CoRR, 2014)

Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification. - Bishoksan Kafle; John P. Gallagher (HCVS, 2014)

Tree Automata-Based Refinement with Application to Horn Clause Verification. - Bishoksan Kafle; John P. Gallagher (VMCAI, 2015)

An Optimised Algorithm for Determinisation and Completion of Finite Tree Automata. - John P. Gallagher; Mai Ajspur; Bishoksan Kafle (CoRR, 2015)

Solving non-linear Horn clauses using a linear solver. - Bishoksan Kafle (CoRR, 2015)

Decomposition by tree dimension in Horn clause verification. - Bishoksan Kafle; John P. Gallagher; Pierre Ganty (VPT@ETAPS, 2015)

Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata. - Bishoksan Kafle; John P. Gallagher; José F. Morales 001 (CAV (1), 2016)

Interpolant tree automata and their application in Horn clause verification. - Bishoksan Kafle; John P. Gallagher (VPT@ETAPS, 2016)

Solving non-linear Horn clauses using a linear Horn clause solver. - Bishoksan Kafle; John P. Gallagher; Pierre Ganty (HCVS@ETAPS, 2016)

ENTRA: Whole-systems energy transparency. - Kerstin Eder; John P. Gallagher; Pedro López-García 001; Henk L. Muller; Zorana Bankovic; Kyriakos Georgiou; Rémy Haemmerlé; Manuel V. Hermenegildo; Bishoksan Kafle; Steve Kerrison; Maja H. Kirkeby; Maximiliano Klemen; et al. (Microprocess. Microsystems, 2016)

A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic. - Bishoksan Kafle; Graeme Gange; Peter Schachte; Harald Søndergaard; Peter J. Stuckey (SAT, 2017)

Horn clause verification with convex polyhedral abstraction and tree automata-based refinement. - Bishoksan Kafle; John P. Gallagher (Comput. Lang. Syst. Struct., 2017)

Constraint specialisation in Horn clause verification. - Bishoksan Kafle; John P. Gallagher (Sci. Comput. Program., 2017)

Precondition Inference via Partitioning of Initial States. - Bishoksan Kafle; Graeme Gange; Peter Schachte; Harald Søndergaard; Peter J. Stuckey (CoRR, 2018)

Optimised determinisation and completion of finite tree automata. - John P. Gallagher; Mai Ajspur; Bishoksan Kafle (J. Log. Algebraic Methods Program., 2018)

Tree dimension in verification of constrained Horn clauses. - Bishoksan Kafle; John P. Gallagher; Pierre Ganty (Theory Pract. Log. Program., 2018)

An iterative approach to precondition inference using constrained Horn clauses. - Bishoksan Kafle; John P. Gallagher; Graeme Gange; Peter Schachte; Harald Søndergaard; Peter J. Stuckey (Theory Pract. Log. Program., 2018)

From Big-Step to Small-Step Semantics and Back with Interpreter Specialisation. - John P. Gallagher; Manuel V. Hermenegildo; Bishoksan Kafle; Maximiliano Klemen; Pedro López-García 001; José F. Morales 001 (VPT/HCVS@ETAPS, 2020)

Lightweight Nontermination Inference with CHCs. - Bishoksan Kafle; Graeme Gange; Peter Schachte; Harald Søndergaard; Peter J. Stuckey (SEFM, 2021)

Regular Path Clauses and Their Application in Solving Loops. - Bishoksan Kafle; John P. Gallagher; Manuel V. Hermenegildo; Maximiliano Klemen; Pedro López-García 001; José F. Morales 001 (HCVS@ETAPS, 2021)

Transformation-Enabled Precondition Inference. - Bishoksan Kafle; Graeme Gange; Peter J. Stuckey; Peter Schachte; Harald Søndergaard (Theory Pract. Log. Program., 2021)

A lightweight approach to nontermination inference using Constrained Horn Clauses. - Bishoksan Kafle; Graeme Gange; Peter Schachte; Harald Søndergaard; Peter J. Stuckey (Softw. Syst. Model., 2024)