• DocumentCode
    500917
  • Title

    Computing bounds for fault tolerance using formal techniques

  • Author

    Fey, Görschwin ; Sülflow, André ; Drechsler, Rolf

  • Author_Institution
    Inst. of Comput. Sci., Univ. of Bremen, Bremen, Germany
  • fYear
    2009
  • fDate
    26-31 July 2009
  • Firstpage
    190
  • Lastpage
    195
  • Abstract
    Continuously shrinking feature sizes result in an increasing susceptibility of circuits to transient faults, e.g. due to environmental radiation. Approaches to implement fault tolerance are known. But assessing the fault tolerance of a given circuit is a tough problem. Here, we propose the use of formal methods to assess the robustness of a digital circuit with respect to transient faults. Our formal model uses a fixed bound in time to cope with the complexity of the underlying sequential equivalence check. The result is a lower and an upper bound on the robustness. The underlying algorithm and techniques to improve the efficiency are presented. In experiments the method is evaluated on circuits with different fault detection mechanisms.
  • Keywords
    circuit CAD; fault tolerance; integrated circuit design; integrated circuit reliability; computing bound; digital circuit; fault tolerance; formal technique; lower bound; sequential equivalence check; transient faults; upper bound; Circuit faults; Circuit testing; Computer science; Digital circuits; Electrical fault detection; Fault tolerance; Formal verification; Reachability analysis; Robustness; Upper bound; Fault Tolerance; Formal Verification; SAT;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design Automation Conference, 2009. DAC '09. 46th ACM/IEEE
  • Conference_Location
    San Francisco, CA
  • ISSN
    0738-100X
  • Print_ISBN
    978-1-6055-8497-3
  • Type

    conf

  • Filename
    5227175