732 search results - page 2 / 147 » Termination of Integer Linear Programs |
CONCUR
2005
Springer
13 years 11 months ago
2005
Springer
Usually, ranking function synthesis and invariant generation oop with integer variables involves abstracting the loop to have real variables. Integer division and modulo arithmetic...
EOR
2007
13 years 5 months ago
2007
The Service Allocation Problem (SAP) is a tactical problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container...
CAV
2004
Springer
13 years 11 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...
LOPSTR
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...
TACAS
2010
Springer
14 years 22 days ago
2010
Springer
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...