default search action
Bishoksan Kafle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Bishoksan Kafle, Graeme Gange, Peter Schachte, Harald Søndergaard
, Peter J. Stuckey:
A lightweight approach to nontermination inference using Constrained Horn Clauses. Softw. Syst. Model. 23(2): 319-342 (2024) - 2023
- [e2]Robert Glück
Logic-Based Program Synthesis and Transformation - 33rd International Symposium, LOPSTR 2023, Cascais, Portugal, October 23-24, 2023, Proceedings. Lecture Notes in Computer Science 14330, Springer 2023, ISBN 978-3-031-45783-8 [contents] - 2021
- [j7]Bishoksan Kafle
Transformation-Enabled Precondition Inference. Theory Pract. Log. Program. 21(6): 700-716 (2021) - [c11]Bishoksan Kafle
Lightweight Nontermination Inference with CHCs. SEFM 2021: 383-402 - [c10]Bishoksan Kafle, John P. Gallagher
Regular Path Clauses and Their Application in Solving Loops. HCVS@ETAPS 2021: 22-35 - [e1]Hossein Hojjat, Bishoksan Kafle:
Proceedings 8th Workshop on Horn Clauses for Verification and Synthesis, HCVS@ETAPS 2021, Virtual, 28th March 2021. EPTCS 344, 2021 [contents] - [i8]Bishoksan Kafle, Graeme Gange, Peter J. Stuckey, Peter Schachte, Harald Søndergaard
Transformation-Enabled Precondition Inference. CoRR abs/2108.03178 (2021) - 2020
- [c9]John P. Gallagher
From Big-Step to Small-Step Semantics and Back with Interpreter Specialisation. VPT/HCVS@ETAPS 2020: 50-64
2010 – 2019
- 2018
- [j6]John P. Gallagher
Optimised determinisation and completion of finite tree automata. J. Log. Algebraic Methods Program. 95: 1-16 (2018) - [j5]Bishoksan Kafle, John P. Gallagher
Tree dimension in verification of constrained Horn clauses. Theory Pract. Log. Program. 18(2): 224-251 (2018) - [j4]Bishoksan Kafle
An iterative approach to precondition inference using constrained Horn clauses. Theory Pract. Log. Program. 18(3-4): 553-570 (2018) - [i7]Bishoksan Kafle, John P. Gallagher, Pierre Ganty:
Tree dimension in verification of constrained Horn clauses. CoRR abs/1803.01448 (2018) - [i6]Bishoksan Kafle, John P. Gallagher, Graeme Gange, Peter Schachte, Harald Søndergaard
An iterative approach to precondition inference using constrained Horn clauses. CoRR abs/1804.05989 (2018) - [i5]Bishoksan Kafle, Graeme Gange, Peter Schachte, Harald Søndergaard
Precondition Inference via Partitioning of Initial States. CoRR abs/1811.06771 (2018) - 2017
- [j3]Bishoksan Kafle, John P. Gallagher
Horn clause verification with convex polyhedral abstraction and tree automata-based refinement. Comput. Lang. Syst. Struct. 47: 2-18 (2017) - [j2]Bishoksan Kafle
Constraint specialisation in Horn clause verification. Sci. Comput. Program. 137: 125-140 (2017) - [c8]Bishoksan Kafle, Graeme Gange
A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic. SAT 2017: 380-397 - 2016
- [j1]Kerstin Eder, John P. Gallagher
ENTRA: Whole-systems energy transparency. Microprocess. Microsystems 47: 278-286 (2016) - [c7]Bishoksan Kafle, John P. Gallagher
Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata. CAV (1) 2016: 261-268 - [c6]Bishoksan Kafle, John P. Gallagher
Solving non-linear Horn clauses using a linear Horn clause solver. HCVS@ETAPS 2016: 33-48 - [c5]Bishoksan Kafle, John P. Gallagher
Interpolant tree automata and their application in Horn clause verification. VPT@ETAPS 2016: 104-117 - [i4]Kerstin Eder, John P. Gallagher, Pedro López-García, Henk L. Muller, Zorana Bankovic, Kyriakos Georgiou
ENTRA: Whole-Systems Energy Transparency. CoRR abs/1606.04074 (2016) - 2015
- [c4]Bishoksan Kafle, John P. Gallagher
Constraint Specialisation in Horn Clause Verification. PEPM 2015: 85-90 - [c3]Bishoksan Kafle, John P. Gallagher
Tree Automata-Based Refinement with Application to Horn Clause Verification. VMCAI 2015: 209-226 - [c2]Bishoksan Kafle, John P. Gallagher, Pierre Ganty:
Decomposition by tree dimension in Horn clause verification. VPT@ETAPS 2015: 1-14 - [i3]John P. Gallagher, Mai Ajspur, Bishoksan Kafle:
An Optimised Algorithm for Determinisation and Completion of Finite Tree Automata. CoRR abs/1511.03595 (2015) - [i2]Bishoksan Kafle:
Solving non-linear Horn clauses using a linear solver. CoRR abs/1511.06668 (2015) - 2014
- [c1]Bishoksan Kafle, John P. Gallagher
Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification. HCVS 2014: 53-67 - [i1]John P. Gallagher, Bishoksan Kafle:
Analysis and Transformation Tools for Constrained Horn Clause Verification. CoRR abs/1405.3883 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: