18 search results - page 2 / 4 » Proving Positive Almost-Sure Termination |
CORR
2011
Springer
13 years 9 days ago
2011
Springer
The Shannon-McMillan-Breiman theorem asserts that the sample entropy of a stationary and ergodic stochastic process converges to the entropy rate of the same process almost surely...
POPL
2009
ACM
14 years 6 months ago
2009
ACM
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
IGPL
1998
13 years 5 months ago
1998
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
ENTCS
2008
13 years 5 months ago
2008
Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to ...
CADE
2010
Springer
13 years 4 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...