Bishoksan Kafle

Orcid: 0000-0001-5191-1216

According to our database1, Bishoksan Kafle authored at least 22 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A lightweight approach to nontermination inference using Constrained Horn Clauses.
Softw. Syst. Model., April, 2024

2021
Transformation-Enabled Precondition Inference.
Theory Pract. Log. Program., 2021

Regular Path Clauses and Their Application in Solving Loops.
Proceedings of the Proceedings 8th Workshop on Horn Clauses for Verification and Synthesis, 2021

Lightweight Nontermination Inference with CHCs.
Proceedings of the Software Engineering and Formal Methods - 19th International Conference, 2021

2020
From Big-Step to Small-Step Semantics and Back with Interpreter Specialisation.
Proceedings of the Proceedings 8th International Workshop on Verification and Program Transformation and 7th Workshop on Horn Clauses for Verification and Synthesis, 2020

2018
An iterative approach to precondition inference using constrained Horn clauses.
Theory Pract. Log. Program., 2018

Tree dimension in verification of constrained Horn clauses.
Theory Pract. Log. Program., 2018

Optimised determinisation and completion of finite tree automata.
J. Log. Algebraic Methods Program., 2018

Precondition Inference via Partitioning of Initial States.
CoRR, 2018

2017
Constraint specialisation in Horn clause verification.
Sci. Comput. Program., 2017

Horn clause verification with convex polyhedral abstraction and tree automata-based refinement.
Comput. Lang. Syst. Struct., 2017

A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

2016
ENTRA: Whole-systems energy transparency.
Microprocess. Microsystems, 2016

Solving non-linear Horn clauses using a linear Horn clause solver.
Proceedings of the Proceedings 3rd Workshop on Horn Clauses for Verification and Synthesis, 2016

Interpolant tree automata and their application in Horn clause verification.
Proceedings of the Fourth International Workshop on Verification and Program Transformation, 2016

Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015
Decomposition by tree dimension in Horn clause verification.
Proceedings of the Third International Workshop on Verification and Program Transformation, 2015

Solving non-linear Horn clauses using a linear solver.
CoRR, 2015

An Optimised Algorithm for Determinisation and Completion of Finite Tree Automata.
CoRR, 2015

Tree Automata-Based Refinement with Application to Horn Clause Verification.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2015

2014
Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification.
Proceedings of the Proceedings First Workshop on Horn Clauses for Verification and Synthesis, 2014

Analysis and Transformation Tools for Constrained Horn Clause Verification.
CoRR, 2014


  Loading...