IntroductiontoSMVandModelChecking.pptVIP

Introduction to SMV and Model Checking SMV Tool Can be downloaded from /~kenmcmil/smv/dld2.html? Outline Quick overview of SMV Model checking Temporal logic Model checking algorithms Expressiveness and complexity Symbolic model checking The “state explosion” problem Binary Decision Diagrams Computing fixed points with BDD’s Application SMV: Symbolic Model Verifier Capture system behavior as combinatorial and sequential logic: finite state machines. Capture system requirements as statements in temporal logic SMV applies the requirement specifications to the state machine model Attempt to prove that system meets requirements If system fails, attempt to show counterexample How SMV Works Convert system model (the FSM) to OBDD representation Convert CTL specifications into operations which can be applied to OBDDs Traverse the state space, applying verification operations until achieving a “fixed point”: stable system Report the results of the traversal, either requirements met or not. Example SMV’s supported CTL operators Propositional Linear Temporal Logic Express properties of “Reactive Systems” interactive, nonterminating For PLTL, a model is an infinite state sequence Temporal operators... Examples Liveness: “if input, then eventually output” G (input T F output) Strong fairness: “infinitely send implies infinitely recv.” GF send T GF recv Weak until: “no output before input” ?output W input Safety v. Liveness Safety Refutable by finite run Liveness Refutable only by infinite run Every finite run extensible to satisfying run PLTL semantics Given an infinite sequence if f is true in state si of s. if f is true in state s0 of s. if f is valid. A formula is an atomic proposition, or... true, p ú q, ?p, p U q, X p PLTL semantics... Definition of satisfaction iff iff iff iff iff Model Checking (Clarke/Emerson, Queille/Sifakis) Kr