Abstract
The promise of cost savings and guaranteed product reliability that have been claimed for formal verification of digital hardware have yet to be realised in practice. Largely, this is because it can be extraordinarily difficult and tedious verifying even a simple design. A large part of this difficulty is caused by the absence of much of real-world engineering theory in available theorem provers. The paper describes the formalisation of deterministic and non-deterministic state-machine theory in the HOL theorem prover. Proofs using the theory are not only shorter, but are much more tractable, and follow standard engineering reasoning much more closely than direct proofs without using the theory.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
