1147 search results - page 13 / 230 » Termination in language-based systems |
CADE
2008
Springer
14 years 7 months ago
2008
Springer
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
RTA
2011
Springer
12 years 10 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
GI
2007
Springer
13 years 11 months ago
2007
Springer
: The decomposition of planning and scheduling problems is a well known technique to make these problems tractable. The resulting dependable subproblems were often solved using dif...
AUTOMATICA
2006
13 years 7 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...