Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction s a Prolog program. Using abstract inte...
Maurice Bruynooghe, Michael Leuschel, Konstantinos...
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...
Competitive parallel execution (CPE) is a simple yet attractive technique to improve the performance of sequential programs on multi-core and multi-processor systems. A sequential...
We have previously proposed PTIDES (Programming Temporally Integrated Distributed Embedded Systems), a discrete-event framework that binds realtime with model time at sensors, act...
Ownership domain annotations enable obtaining at compiletime the system’s execution structure from the annotated program. The execution structure is sound, hierarchical (and thu...