Sciweavers

444 search results - page 3 / 89
» Termination by Abstraction
Sort
View
LPAR
2005
Springer
14 years 1 months ago
Termination of Fair Computations in Term Rewriting
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...
Salvador Lucas, José Meseguer
CAV
2006
Springer
143views Hardware» more  CAV 2006»
13 years 11 months ago
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
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....
PAAPP
2006
71views more  PAAPP 2006»
13 years 7 months ago
An efficient parallel termination detection algorithm
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....
FMOODS
2008
13 years 9 months ago
Termination Analysis of Java Bytecode
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 ...
LPAR
2004
Springer
14 years 1 months ago
Abstract DPLL and Abstract DPLL Modulo Theories
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...