Formal reliability analysis of combinational circuits using theorem proving

DOI10.1016/J.JAL.2011.01.002zbMATH Open1217.94140OpenAlexW2115026027MaRDI QIDQ545153FDOQ545153

Sofiène Tahar, Osman Hasan, Jigar Patel

Publication date: 22 June 2011

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://spectrum.library.concordia.ca/974497/1/formal_reliability_analysis_of_combinational.pdf

zbMATH Keywords

theorem provingformal verificationhigher-order logicHOLreliability analysiscombinational circuits

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A theory of type polymorphism in programming
• Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems
• Formal Reliability Analysis Using Theorem Proving
• The Probability of a Correct Output from a Combinational Circuit
• Reliability Analysis of Large Circuits Using Scalable Techniques and Tools
• On Reliability Modeling and Analysis of Ultrareliable Fault-Tolerant Digital Systems

Cited In (3)

• Formal Dependability Modeling and Analysis: A Survey
• Towards the Formal Reliability Analysis of Oil and Gas Pipelines
• Formal verification of n-bit ALU using theorem proving

Uses Software

• ML
• HOL

This page was built for publication: Formal reliability analysis of combinational circuits using theorem proving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545153)