Formal Analysis of Soft Errors using Theorem Proving
The work
| Authors | Naeem Abbasi; Osman Hasan; Sofiène Tahar |
|---|---|
| Editors | |
| Type | article |
| Year | 2013 |
| Citekey | abbasi2013formal |
Where it appeared
| Published in | Electronic Proceedings in Theoretical Computer Science |
|---|---|
| Volume | 122 |
| Pages | 75--84 |
Identifiers
| arXiv | 1307.8213 from its landing_page_url |
|---|---|
| DOI | 10.4204/eptcs.122.7 |
Access
| Landing page | https://arxiv.org/abs/1307.8213 |
|---|
Related
| Distinct from | khalid2022forasec |
|---|---|
| Distinct from | mishagli2024statistical |
| Distinct from | rashid2020fasim |
| Distinct from | waddoups2025probabilistic |
From bibtex.
Abstract
Modeling and analysis of soft errors in electronic circuits has traditionally been done using computer simulations. Computer simulations cannot guarantee correctness of analysis because they utilize approximate real number representations and pseudo random numbers in the analysis and thus are not well suited for analyzing safety-critical applications. In this paper, we present a higher-order logic theorem proving based method for modeling and analysis of soft errors in electronic circuits. Our developed infrastructure includes formalized continuous random variable pairs, their Cumulative Distribution Function (CDF) properties and independent standard uniform and Gaussian random variables. We illustrate the usefulness of our approach by modeling and analyzing soft errors in commonly used dynamic random access memory sense amplifier circuits.
Cite it as
@article{abbasi2013formal,
title = {Formal Analysis of Soft Errors using Theorem Proving},
author = {Naeem Abbasi and Osman Hasan and Sofiène Tahar},
year = {2013},
journal = {Electronic Proceedings in Theoretical Computer Science},
volume = {122},
pages = {75--84},
doi = {10.4204/eptcs.122.7},
}
This record lives at https://refs.drheap.org/abbasi2013formal/ and will keep doing so.