Sciweavers

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

11

VMCAI
2004
Springer

favoriteEmaildiscussreport

93views Software Engineering» more VMCAI 2004»

Completeness and Complexity of Bounded Model Checking

13 years 10 months ago

Completeness and Complexity of Bounded Model Checking

Download www.kroening.com

Edmund M. Clarke, Daniel Kroening, Joël Ouakn

Real-time Traffic

Software Engineering | VMCAI 2004 |

claim paper

Related Content

» The Complexity of Model Checking HigherOrder Fixpoint Logic

» The Complexity of Games on Higher Order Pushdown Automata

» Incremental and Complete Bounded Model Checking for Full PLTL

» A New Approach to Bounded Model Checking for Branching Time Logics

» Verifying Web Applications Using Bounded Model Checking

» Continuous Verification of Large Embedded Software Using SMTBased Bounded Model Checking

» On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs

» Complexity of Model Checking by Iterative Improvement The PseudoBoolean Framework

» Computing OverApproximations with Bounded Model Checking

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	VMCAI
Authors	Edmund M. Clarke, Daniel Kroening, Joël Ouaknine, Ofer Strichman

Comments (0)