223 search results - page 5 / 45 » Proving Termination by Bounded Increase |
178
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
169
click to vote
ICLP
1999
Springer
15 years 10 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
146
click to vote
AIRWEB
2005
Springer
15 years 11 months ago
2005
Springer
We study the impact of collusion –nepotistic linking– in a Web graph in terms of Pagerank. We prove a bound on the Pagerank increase that depends both on the reset probability...
176
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream spec...
174
click to vote
AAECC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...