1204 search results - page 1 / 241 » Termination of Polynomial Programs |
ICLP
2005
Springer
13 years 10 months ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
VMCAI
2005
Springer
13 years 10 months ago
2005
Springer
We present a technique to prove termination of multipath polynomial programs, an expressive class of loops that enables practical traction and analysis. The technique is based on ï...
FOSSACS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
ENTCS
2006
13 years 5 months ago
2006
We are concerned with programs composed of cooperative threads whose execution proceeds in synchronous rounds called instants. We develop static analysis methods to guarantee that...
SAS
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...