1 / 12

Software Verification 2 Automated Verification

Software Verification 2 Automated Verification. Prof. Dr. Holger Schlingloff Institut für Informatik der Humboldt Universität and Fraunhofer Institut für Rechnerarchitektur und Softwaretechnik. CTL model checking. For each LTS/model there is exactly one computation tree

elysia
Télécharger la présentation

Software Verification 2 Automated Verification

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Software Verification 2Automated Verification Prof. Dr. Holger Schlingloff Institut für Informatik der Humboldt Universität and Fraunhofer Institut für Rechnerarchitektur und Softwaretechnik

  2. CTL model checking • For each LTS/model there is exactly one computation tree • CTL model checking works directly on the model (no need to extract computation sequences) • For all subformulas of a formula and all states of a given model, mark whether the state satisfies the subformula • iteration on formulas according to their inductive definition • if p is an atomic proposition, then pM= I(p) • M={} • (φψ)M = (M-φM +ψ M) • (EXφ)M = {w | w‘ (wRw‘ w‘φM )} • (AXφ)M = {w | Aw‘ (wRw‘w‘φM )}

  3. Symbolic Representation • Modelchecking algorithm deals with sets of states and with relations (sets of pairs of states) • Need an efficient representation • BDD of the set {x | x >12 or even} • x1&x2 | !x4

  4. Calculation of BDDs

  5. The Influence of Variable Ordering • Heuristics: keep dependent variables close together!

  6. Operations on BDDs • Negation: easy (exchange T and F) • Falsum: trivial • and, or: Shannon expansion • (φ OP ψ) = x  (φ{x:=T} OP ψ{x:=T}) ¬ x  (φ{x:=} OP ψ{x:=}) • (φψ) = (x  (φ{x:=T}ψ{x:=T}))  (¬ x  (φ{x:=}ψ{x:=})) • BDD realization?

  7. BDD-implies

  8. Transitive Closure • Each finite (transition) relation can be represented as a boolean formula / BDD • The transitive closure of a relation R is defined recursively by • Thus, transitive closure be calculated by an iteration on BDDs • Logical operations (, , ) can be directly performed on BDDs

  9. Reachability • State s is reachable iff s0R*s, where s0S0 is an initial state and R is the transition relation • Reachability is one of the most important properties in verification • most safety properties can be reduced to it • in a search algorithm, is the goal reachable? • Can be arbitrarily hard • for infinite state systems undecidable • Can be efficiently calculated with BDDs

  10. Intuitively, xR*y iff there is a sequence w0 w1 ... wn of nodes connecting x with y • In a finite model, this sequence must be smaller than the number of states. • In practice, usually a few dozen steps are sufficient

  11. Reflection • What has been achieved Vorläufige Vorlesungsplanung • Einführung • Modellierung von Systemen • Temporale Logik • Modellprüfung • Symbolische Repräsentation • Abstraktion • Realzeit • Where this is relevant • HW design (IEEE‐1850 PSL) • Safety-critical SW design • Embedded systems design

  12. Feedback

More Related