200 citations · 450 across the 51 of their papers we have counts for
12 papers · 1 filter
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…
MiniZinc with Strings
Roberto Amadini, Pierre Flener, Justin Pearson +3
Strings are extensively used in modern programming languages and constraints over strings of unknown length occur in a wide range of real-world applications such as software analys…
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…
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…
ACD Term Rewriting
Gregory J. Duck, Peter J. Stuckey, Sebastian Brand
We introduce Associative Commutative Distributive Term Rewriting (ACDTR), a rewriting language for rewriting logical formulae. ACDTR extends AC term rewriting by adding distributio…
Solving Partial Order Constraints for LPO Termination
Michael Codish, Vitaly Lagoon, Peter J. Stuckey
This paper introduces a new kind of propositional encoding for reasoning about partial orders. The symbols in an unspecified partial order are viewed as variables which take intege…