Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
Josh Berdine, Byron Cook, Dino Distefano, Peter W....
Abstract: In this paper, we present a new, easy to implement algorithm for detecting the termination of a parallel asynchronous computation on distributedmemory MIMD computers. We ...
Allison H. Baker, Silvia A. Crivelli, Elizabeth R....
Abstract. Termination analysis has received considerable attention, traditionally in the context of declarative programming, and recently also for imperative languages. In existing...
Elvira Albert, Puri Arenas, Michael Codish, Samir ...
DPLL and DPLL Modulo Theories Robert Nieuwenhuis , Albert Oliveras , and Cesare Tinelli We introduce Abstract DPLL, a general and simple abstract rule-based formulation of the Davi...
Robert Nieuwenhuis, Albert Oliveras, Cesare Tinell...