1204 search results - page 14 / 241 » Termination of Polynomial Programs |
CAV
2006
Springer
14 years 2 months ago
2006
Springer
We show that termination of a simple class of linear loops over the integers is decidable. Namely we show that termination of deterministic linear loops is decidable over the integ...
RTA
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
CORR
2000
Springer
13 years 10 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
ESSLLI
2009
Springer
13 years 8 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
POPL
2001
ACM
14 years 11 months ago
2001
ACM