Sciweavers

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

12

CAV
2005
Springer

favoriteEmaildiscussreport

135views Hardware» more CAV 2005»

Linear Ranking with Reachability

13 years 9 months ago

Linear Ranking with Reachability

Download theory.stanford.edu

We present a complete method for synthesizing lexicographic linear ranking functions supported by inductive linear invariants for loops with linear guards and transitions. Proving termination via linear ranking functions often requires invariants; yet invariant generation is expensive. Thus, we describe a technique that discovers just the invariants necessary for proving termination. Finally, we describe an implementation of the method and provide extensive experimental evidence of its eﬀectiveness for proving termination of C loops.

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

Real-time Traffic

CAV 2005 | Formal Methods | Inductive Linear Invariants | Lexicographic Linear | Linear Ranking Functions |

claim paper

Related Content

» Schurbased decomposition for reachability analysis of linear timeinvariant systems

» Reachability analysis of nonlinear systems with uncertain parameters using conservative li...

» Controllability and reachability criteria for switched linear systems

» Reachability analysis of continuoustime piecewise affine systems

» Analyzing Reachability for Some Petri Nets With Fast Growing Markings

» Schedulability Analysis of Petri Nets Based on Structural Properties

» Finite Automata as TimeInv Linear Systems Observability Reachability and More

» Rewriting Systems for Reachability in Vector Addition Systems with Pairs

» Approximate Reachability Analysis of PiecewiseLinear Dynamical Systems

Post Info
More Details (n/a)

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

Comments (0)