Sciweavers

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

40

CAV
2004
Springer

favoriteEmaildiscussreport

128views Hardware» more CAV 2004»

Proving More Properties with Bounded Model Checking

14 years 4 months ago

Proving More Properties with Bounded Model Checking

Download vlsi.colorado.edu

Bounded Model Checking, although complete in theory, has been thus far limited in practice to falsiﬁcation of properties that were not invariants. In this paper we propose a termination criterion for all of LTL, and we show its effectiveness through experiments. Our approach is based on converting the LTL formula to a B¨uchi automaton so as to reduce model checking to the veriﬁcation of a fairness constraint. This reduction leads to one termination criterion that applies to all formulae. We also discuss cases for which a dedicated termination test improves bounded model checking efﬁciency.

Mohammad Awedh, Fabio Somenzi

Real-time Traffic

CAV 2004 | Formal Methods | LTL Formula | Model Checking | Termination Criterion |

claim paper

Related Content

» Automatic invariant strengthening to prove properties in bounded model checking

» Proving Functional Equivalence of Two AES Implementations Using Bounded Model Checking

» Approximate Model Checking of PCTL Involving Unbounded Path Properties

» Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reach...

» Model Checking Using SMT and Theory of Lists

» Lazy Theorem Proving for Bounded Model Checking over Infinite Domains

» Incremental and Complete Bounded Model Checking for Full PLTL

» Methods for exploiting SAT solvers in unbounded model checking

» Model Checking for a Class of Performance Properties of Fluid Stochastic Models

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	CAV
Authors	Mohammad Awedh, Fabio Somenzi

Comments (0)