We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
We study multiple predicate learning in an empirical setting. Problems with existing inductive logic programming approaches in this setting are sketched and an empirical ILP syste...
We propose a new focus in language design where languages provide constructs that not only describe the computation of results, but also produce explanations of how and why those r...
Abstract. This paper introduces Higher-Order Bayesian Networks, a probabilistic reasoning formalism which combines the efficient reasoning mechanisms of Bayesian Networks with the...
One of the open problems in the area of domain-specific languages is how to make domain-specific language development easier for domain experts not versed in a programming languag...
Marjan Mernik, Goran Gerlic, Viljem Zumer, Barrett...