1716 search results - page 105 / 344 » Proving Conditional Termination |
184
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
164
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
Synchronous reinforcement learning (RL) algorithms with linear function approximation are representable as inhomogeneous matrix iterations of a special form (Schoknecht & Merk...
156
click to vote
INFOCOM
2005
IEEE
15 years 12 months ago
2005
IEEE
We discuss the modelling of FAST TCP and prove four stability results. Using the traditional continuous-time flow model, we prove, for general networks, that FAST TCP is globally ...
209
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
161
click to vote
TABLEAUX
2007
Springer
16 years 13 days ago
2007
Springer
We construct a sound, complete, and terminating tableau system for the interval temporal logic D · interpreted in interval structures over dense linear orderings endowed with stri...