Techniques for temporal logic model checking

被引:0
|
作者
Deharbe, David [1 ]
机构
[1] Univ Fed Rio Grande Norte, Dept Informat, BR-59072970 Natal, RN, Brazil
[2] Univ Fed Rio Grande Norte, Dept Matemat Aplicada, BR-59072970 Natal, RN, Brazil
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Model checking is a set of formal verification techniques that aim to show that a structure representing a computational system (for instance, a protocol, or a hardware or a software component, among others) is a model for a property that represents a requirement for this system. Many model-checking approaches have been proposed, depending on the formalism the property is expressed in, and the class of structures used to represent the system under verification. In the next section, we motivate the use of model-checking, and summarize the research work that has been carried out in this area. In Section 2, we discuss Kripke structures, one of the main state-transition models in the model-checking literature. Section 3 is devoted to propositional temporal logics commonly used in the realm of program verification: CTL*, CTL and LTL. Their expressiveness is compared and illustrated. Section 4 provides the key components of explicit model-checking for the temporal logic LTL, and introduces some advanced techniques that are used in current implementations such as the SPIN model-checker. Then, in Section 5, we present the decision procedure for CTL as originally proposed in the seminal work of [62] and [218]. Next, in Section 6, we present how Kripke structures can be represented and analyzed using quantified propositional logic, and introduce Binary Decision Diagrams (BDDs), an efficient implementation of this logic; at that point we are ready to present symbolic model-checking. We also present the symbolic model-checking features of the NuSMV model-checker. Section 7 is devoted to so-called bounded model-checking. This technique makes it possible to verify (in general partially) LTL properties of much larger structures than the previous approaches. We also present the bounded model-checking features of NuSMV. Finally, in Section 8, we briefly touch upon some of the most recent developments in formal verification of software, some of which employ techniques that had been initially developed to enhance model checkers.
引用
收藏
页码:315 / 367
页数:53
相关论文
共 50 条
  • [1] Temporal logic and model checking
    McMillan, KL
    [J]. VERIFICATION OF DIGITAL AND HYBRID SYSTEM, 2000, 170 : 36 - 54
  • [2] Temporal logic model checking
    Clarke, EM
    [J]. LOGIC PROGRAMMING - PROCEEDINGS OF THE 1997 INTERNATIONAL SYMPOSIUM, 1997, : 3 - 3
  • [3] UTP and Temporal Logic Model Checking
    Anderson, Hugh
    Ciobanu, Gabriel
    Freitas, Leo
    [J]. UNIFYING THEORIES OF PROGRAMMING, 2010, 5713 : 22 - +
  • [4] Model checking distributed temporal logic
    Dionisio, Francisco
    Ramos, Jaime
    Subtil, Fernando
    Vigano, Luca
    [J]. LOGIC JOURNAL OF THE IGPL, 2024,
  • [5] Model checking interval temporal logic
    Zhang, Hai-Bin
    Duan, Zhen-Hua
    [J]. Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University, 2009, 36 (02): : 338 - 342
  • [6] Symmetry in temporal logic model checking
    Miller, Alice
    Donaldson, Alastair
    Calder, Muffy
    [J]. ACM COMPUTING SURVEYS, 2006, 38 (03) : 2
  • [7] RESOLUTION AND MODEL CHECKING FOR TEMPORAL LOGIC - A COMPARISON
    CAVALLI, AR
    [J]. JOURNAL OF SYMBOLIC LOGIC, 1987, 52 (04) : 1063 - 1063
  • [8] Exploiting symmetry in temporal logic model checking
    Clarke, EM
    Enders, R
    Filkorn, T
    Jha, S
    [J]. FORMAL METHODS IN SYSTEM DESIGN, 1996, 9 (1-2) : 77 - 104
  • [9] Bounded model checking distributed temporal logic
    Peres, Augusto
    Ramos, Jaime
    Dionisio, Francisco
    [J]. JOURNAL OF LOGIC AND COMPUTATION, 2023, 33 (05) : 1022 - 1059
  • [10] Coverage metrics for temporal logic model checking*
    Hana Chockler
    Orna Kupferman
    Moshe Y. Vardi
    [J]. Formal Methods in System Design, 2006, 28 : 189 - 212