4 papers
Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses
Toby Cathcart Burn, Luke Ong, Steven Ramsay +1
We present initial limit Datalog, a new extensible class of constrained Horn clauses for which the satisfiability problem is decidable. The class may be viewed as a generalisation…
Verifying Liveness Properties of ML Programs
M. M. Lester, R. P. Neatherway, C. -H. L. Ong +1
Higher-order recursion schemes are a higher-order analogue of Boolean Programs; they form a natural class of abstractions for functional programs. We present a new, efficient algor…
Intensional Datatype Refinement
Eddie Jones, Steven Ramsay
The pattern-match safety problem is to verify that a given functional program will never crash due to non-exhaustive patterns in its function definitions. We present a refinement t…
Defunctionalization of Higher-Order Constrained Horn Clauses
Long Pham, Steven J. Ramsay, C. -H. Luke Ong
Building on the successes of satisfiability modulo theories (SMT), Bjørner et al. initiated a research programme advocating Horn constraints as a suitable basis for automatic progr…