Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

VMCAI
2005
Springer

favoriteEmaildiscussreport

61views Software Engineering» more VMCAI 2005»

Termination of Polynomial Programs

13 years 10 months ago

Termination of Polynomial Programs

Download theory.stanford.edu

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 ﬁnite diﬀerences of expressions over transition systems. Although no complete method exists for determining termination for this class of loops, we show that our technique is useful in practice. We demonstrate that our prototype implementation for C source code readily scales to large software projects, proving termination for a high percentage of targeted loops.

Aaron R. Bradley, Zohar Manna, Henny B. Sipma

Real-time Traffic

Complete Method Exists | Expressive Class | Multipath Polynomial Programs | Software Engineering | VMCAI 2005 |

claim paper

Related Content

» Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs

» Polynomials for Proving Termination of ContextSensitive Rewriting

» Feasible Reactivity for Synchronous Cooperative Threads

» Multidimensional Rankings Program Termination and Complexity Bounds of Flowchart Programs

» Termination Analysis of Logic Programs Based on Dependency Graphs

» A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs

» AllTerminationT

» Calculating Polynomial Runtime Properties

» TerminationInsensitive Noninterference Leaks More Than Just a Bit

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	VMCAI
Authors	Aaron R. Bradley, Zohar Manna, Henny B. Sipma

Comments (0)