Sciweavers

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

33

ICLP
2009
Springer

favoriteEmaildiscussreport

106views Automated Reasoning» more ICLP 2009»

Proving Termination by Invariance Relations

13 years 8 months ago

Proving Termination by Invariance Relations

Download lirias.kuleuven.be

Paolo Pilozzi, Danny De Schreye

Real-time Traffic

Automated Reasoning | ICLP 2009 |

claim paper

Related Content

» Termination Analysis with Compositional Transition Invariants

» Proving Program Invariance and Termination by Parametric Abstraction Lagrangian Relaxation...

» Automatic invariant strengthening to prove properties in bounded model checking

» GoalDirected and Relative Dependency Pairs for Proving the Termination of Narrowing

» Proving Termination of Tree Manipulating Programs

» Linear Ranking with Reachability

» Proving More Properties with Bounded Model Checking

» Proving Termination of Rewrite Systems Using Bounds

» Polynomials for Proving Termination of ContextSensitive Rewriting

Post Info
More Details (n/a)

Added	19 Feb 2011
Updated	19 Feb 2011
Type	Journal
Year	2009
Where	ICLP
Authors	Paolo Pilozzi, Danny De Schreye

Comments (0)