A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
We present a method for specialising the constraints in constrained Horn clauses with respect to a goal. We use abstract interpretation to compute a model of a query-answer transformation of a given set of clauses and a goal. The effect is to propagate the constraints from the goal top-down and propagate answer constraints bottomup. Our approach does not unfold the clauses at all; we use the constraints from the model to compute a specialised version of each clause in the program. The approachdoi:10.1145/2678015.2682544 dblp:conf/pepm/KafleG15 fatcat:m3xng6yzfnbeloje2xl3xzw5ui