We present a framework for defining abstract interpreters for liveness properties, in particular program termination. The framework makes use of the theory of metric spaces to defi...
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
A simple cut elimination proof for arithmetic with epsilon symbol is used to establish termination of a modified epsilon substitution process. This opens a possibility of extensio...
Modeling and simulation are essential tools for the design and analysis of container terminals. A computer model can emulate the activities at various levels of details and captur...
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...