Formal Reliability Analysis Using Theorem Proving

被引:20
|
作者
Hasan, Osman [1 ]
Tahar, Sofiene [1 ]
Abbasi, Naeem [1 ]
机构
[1] Concordia Univ, Dept Elect & Comp Engn, Montreal, PQ H3G 1M8, Canada
关键词
Formal models; performance and reliability; theorem proving; memory structures; MEMORY ARRAYS; RECONFIGURATION; FAULTS;
D O I
10.1109/TC.2009.165
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Reliability analysis has become a tool of fundamental importance to virtually all electrical and computer engineers because of the extensive usage of hardware systems in safety and mission critical domains, such as medicine, military, and transportation. Due to the strong relationship between reliability theory and probabilistic notions, computer simulation techniques have been traditionally used to perform reliability analysis. However, simulation provides less accurate results and cannot handle large-scale systems due to its enormous CPU time requirements. To ensure accurate and complete reliability analysis and thus more reliable hardware designs, we propose to conduct a formal reliability analysis of systems within the sound core of a higher order logic theorem prover (HOL). In this paper, we present the higher order logic formalization of some fundamental reliability theory concepts, which can be built upon to precisely analyze the reliability of various engineering systems. The proposed approach and formalization is then utilized to analyze the repairability conditions for a reconfigurable memory array in the presence of stuck-at and coupling faults.
引用
收藏
页码:579 / 592
页数:14
相关论文
共 50 条
  • [41] Relational STE and Theorem Proving for Formal Verification of Industrial Circuit Designs
    O'Leary, John
    Kaivola, Roope
    Melham, Tom
    [J]. 2013 FORMAL METHODS IN COMPUTER-AIDED DESIGN (FMCAD), 2013, : 97 - 104
  • [42] Using animation in diagrammatic theorem proving
    Winterstein, D
    Bundy, A
    Gurr, C
    Jamnik, M
    [J]. DIAGRAMMATIC REPRESENTATION AND INFERENCE, 2002, 2317 : 46 - 60
  • [43] INFERENCE-SECURITY ANALYSIS USING RESOLUTION THEOREM-PROVING
    ROWE, NC
    [J]. PROCEEDINGS : FIFTH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, 1989, : 410 - 416
  • [44] USING EXAMPLES, CASE ANALYSIS, AND DEPENDENCY GRAPHS IN THEOREM-PROVING
    PLAISTED, DA
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1984, 170 : 356 - 374
  • [45] Probabilistic analysis of dynamic fault trees using HOL theorem proving
    Elderhalli, Yassmeen
    Ahmad, Waqar
    Hasan, Osman
    Tahar, Sofiène
    [J]. Journal of Applied Logics, 2019, 6 (03): : 469 - 511
  • [46] PROBABILISTIC ANALYSIS OF DYNAMIC FAULT TREES USING HOL THEOREM PROVING
    Elderhalli, Yassmeen
    Ahmad, Waqar
    Hasan, Osman
    Tahar, Sofiene
    [J]. JOURNAL OF APPLIED LOGICS-IFCOLOG JOURNAL OF LOGICS AND THEIR APPLICATIONS, 2019, 6 (03): : 469 - 511
  • [47] On proving safety properties by integrating static analysis, theorem proving and abstraction
    Rusu, V
    Singerman, E
    [J]. TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, 1999, 1579 : 178 - 192
  • [48] Executing the formal semantics of the accellera property specification language by mechanised theorem proving
    Gordon, M
    Hurd, J
    Slind, K
    [J]. CORRECT HARDWARE DESIGN AND VERIFICATION METHODS, PROCEEDINGS, 2003, 2860 : 200 - 215
  • [49] Formal Verification of C Systems CodeStructured Types, Separation Logic and Theorem Proving
    Harvey Tuch
    [J]. Journal of Automated Reasoning, 2009, 42 : 125 - 187
  • [50] Theorem proving based Formal Verification of Distributed Dynamic Thermal Management schemes
    Sardar, Muhammad Usama
    Hasan, Osman
    Shafique, Muhammad
    Henkel, Joerg
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2017, 100 : 157 - 171