Termination of Polynomial Programs


We present a technique to prove termination of multipath polynomial programs, an expressive class of loops that enables practical code abstraction and analysis. The technique is based on finite differences of expressions over transition systems. Although no complete method exists for determining termination for this class of loops, we show that our… (More)
DOI: 10.1007/978-3-540-30579-8_8

5 Figures and Tables



Citations per Year

175 Citations

Semantic Scholar estimates that this publication has 175 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics