Automatic Formal Correspondence Checking of ISA and RTL Microprocessor Description
- 1 December 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15504093,p. 6-12
Abstract
The paper proposes an automated approach with a formal basis designed for checking correspondence between an RTL implementation of a microprocessor and a description of its instruction set architecture (ISA). The goals of the approach are to find bugs not discovered by functional verification, to minimize user intervention in the verification process, and to provide a developer with practical results within a short period of time. The main idea is to use bounded model checking to check that the output produced by automatically derived RTL and ISA models of a given processor are the same for each instruction and each possible input. Although the approach does not provide full formal verification, experiments with the approach confirm that due to a different way it explores the state space of the design under test, it can find bugs not found by functional verification, and is thus a useful complement to functional verification.Keywords
This publication has 16 references indexed in Scilit:
- Automatic formal verification of multithreaded pipelined microprocessors2011
- Property Learning Techniques for Efficient Generation of Directed TestsIEEE Transactions on Computers, 2011
- Fast Cycle-Accurate Interpreted Simulation2009
- Generating test programs to cover pipeline interactions2009
- Functional test generation using design and property decomposition techniquesACM Transactions on Embedded Computing Systems, 2009
- Unbounded Protocol Compliance Verification Using Interval Property Checking With InvariantsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2008
- Verification of Embedded Memory Systems using Efficient Memory Modeling2005
- Efficient translation of Boolean formulas to CNF in formal verification of microprocessors2004
- Exploiting signal unobservability for efficient translation to CNF in formal verification of microprocessors2004
- Bounded Model Checking2003