1716 search results - page 23 / 344 » Proving Conditional Termination |
CATS
2007
13 years 10 months ago
2007
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
RTA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. The automated analysis of termination of term rewriting systems (TRSs) has drawn a lot of attention in the scientific community during the last decades and many differe...
AUTOMATICA
2006
13 years 8 months ago
2006
In this paper, Receding Horizon Model Predictive Control (RHMPC) of nonlinear systems subject to input and state constraints is considered. We propose to estimate the terminal reg...
CTRS
1992
14 years 22 days ago
1992
We show that a simple, and easily implementable, restriction on the recursive path ordering, which we call the "binary path condition," sufficesfor establishing terminat...
SAS
2010
Springer
13 years 7 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...