NDLI: Formal Reliability Analysis Using Theorem Proving

Content Provider	IEEE Xplore Digital Library
Author	Hasan, O. Tahar, S. Abbasi, N.
Copyright Year	1968
Abstract	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.
Sponsorship	IEEE Computer Society Technical Committee on Distributed Process IEEE Computer Society Technical Committee on VLSI IEEE Technical Committee on Computer Architecture IEEE Computer Society
Starting Page	579
Ending Page	592
Page Count	14
File Size	714275
File Format	PDF
ISSN	00189340
Volume Number	59
Issue Number	5
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-05-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Reliability theory Random variables Analytical models Probabilistic logic Arrays Mathematical model memory structures. Formal models performance and reliability theorem proving
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computational Theory and Mathematics Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Probabilistic miss equations: evaluating memory hierarchy performance

Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables

Automated Synthesis of Combinational Logic Using Theorem-Proving Techniques

Copula Models of Correlation: A DRAM Case Study

Automated Design of Multiple-Valued Logic Circuits by Automatic Theorem Proving Techniques

A Formal C Memory Model for Separation Logic

Integrating Evolutionary Computation with Abstraction Refinement for Model Checking

A Formal C Memory Model for Separation Logic

Methods for Automated Theorem Proving in Nonclassical Logics

Formal Reliability Analysis Using Theorem Proving

Similar Documents

Probabilistic miss equations: evaluating memory hierarchy performance

Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables

Automated Synthesis of Combinational Logic Using Theorem-Proving Techniques

Copula Models of Correlation: A DRAM Case Study

Automated Design of Multiple-Valued Logic Circuits by Automatic Theorem Proving Techniques

A Formal C Memory Model for Separation Logic

Integrating Evolutionary Computation with Abstraction Refinement for Model Checking

A Formal C Memory Model for Separation Logic

Methods for Automated Theorem Proving in Nonclassical Logics

Formal Reliability Analysis Using Theorem Proving