1204 search results - page 11 / 241 » Termination of Polynomial Programs |
CAV
2004
Springer
14 years 4 months ago
2004
Springer
We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination, that is...
CAV
2006
Springer
14 years 2 months ago
2006
Springer
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
PPDP
2001
Springer
14 years 3 months ago
2001
Springer
IANDC
2008
13 years 11 months ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
IFIP
2009
Springer
13 years 8 months ago
2009
Springer
: Intermodality has been a hot topic in the logistics sector for several decades, but the expected diffusion into business is still limited. The key to increased intermodalism lies...