Towards robustness analysis using PVS

DOI10.1007/978-3-642-22863-6_8MaRDI QIDQ3087998zbMATH OpenOpenAlexFDO

Authors Renaud Clavel, Laurence Pierre, R. Leveugle

Publication date 17 August 2011

Published in Interactive Theorem Proving (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22863-6_8

Mathematics Subject Classification ID

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

Recommendations

• Formal reliability analysis of combinational circuits using theorem proving
• Feasibility analysis for robustness quantification by symbolic model checking
• A framework for formal dynamic dependability analysis using HOL theorem proving
• scientific article; zbMATH DE number 732939
• A methodology for the rapid injection of transient hardware errors

Cites work

• Feasibility analysis for robustness quantification by symbolic model checking
• Formal Reliability Analysis Using Theorem Proving
• Robustness and usability in modern design flows
• Structured theory development for a mechanized logic

Cited in

(2)

• PVS\#: streamlined tacticals for PVS
• scientific article; zbMATH DE number 1863391 (Why is no real title available?)

Describes a project that uses

Uses Software

• ACL2
• PVS

This page was built for publication: Towards robustness analysis using PVS

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