Sciweavers

328 search results - page 10 / 66
» Simple Termination Revisited
Sort
View
LOPSTR
2009
Springer
15 years 6 months ago
Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
José Iborra, Naoki Nishida, Germán V...
DSN
2002
IEEE
15 years 4 months ago
A Realistic Look At Failure Detectors
This paper shows that, in an environment where we do not bound the number of faulty processes, the class P of Perfect failure detectors is the weakest (among realistic failure det...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
EURONGI
2008
Springer
15 years 1 months ago
Location Management Based on the Mobility Patterns of Mobile Users
In this paper, we propose a new mobility model as an extension of the random walk model. Our proposal gathers mobility patterns with several degrees of randomness, so that both ran...
Ignacio Martinez-Arrue, Pablo García-Escall...
90
Voted
CSL
2001
Springer
15 years 4 months ago
Life without the Terminal Type
We introduce a method of extending arbitrary categories by a terminal object and apply this method in various type theoretic settings. In particular, we show that categories that a...
Lutz Schröder
FOSSACS
2004
Springer
15 years 5 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas