activity
20142021
most citedHorn Clauses as an Intermediate Representation for Program Analysis and Transformation

20 citations · 40 across the 6 of their papers we have counts for

collaborators

7 papers

cs.PL2021★ 3 cited

Transformation-Enabled Precondition Inference

Bishoksan Kafle, Graeme Gange, Peter J. Stuckey +2

Precondition inference is a non-trivial problem with important applications in program analysis and verification. We present a novel iterative method for automatically deriving pre…

cs.LO2018

Precondition Inference via Partitioning of Initial States

Bishoksan Kafle, Graeme Gange, Peter Schachte +2

Precondition inference is a non-trivial task with several applications in program analysis and verification. We present a novel iterative method for automatically deriving sufficie…

cs.LO2018

An iterative approach to precondition inference using constrained Horn clauses

Bishoksan Kafle, John P. Gallagher, Graeme Gange +3

We present a method for automatic inference of conditions on the initial states of a program that guarantee that the safety assertions in the program are not violated. Constrained…

cs.PL2015★ 20 cited

Horn Clauses as an Intermediate Representation for Program Analysis and Transformation

Graeme Gange, Jorge A. Navas, Peter Schachte +2

Many recent analyses for conventional imperative programs begin by transforming programs into logic programs, capitalising on existing LP analyses and simple LP semantics. We propo…

cs.FL2014★ 1 cited

A Complete Refinement Procedure for Regular Separability of Context-Free Languages

Graeme Gange, Jorge A. Navas, Peter Schachte +2

Often, when analyzing the behaviour of systems modelled as context-free languages, we wish to know if two languages overlap. To this end, we present an effective semi-decision proc…

cs.PL2014★ 1 cited

A Partial-Order Approach to Array Content Analysis

Graeme Gange, Jorge A. Navas, Peter Schachte +2

We present a parametric abstract domain for array content analysis. The method maintains invariants for contiguous regions of the array, similar to the methods of Gopan, Reps and S…

cs.AI2014★ 15 cited

Fast Set Bounds Propagation Using a BDD-SAT Hybrid

Graeme Gange, Peter James Stuckey, Vitaly Lagoon

Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques in- cur the s…