Proceedings - ACM IEEE Design Automation Conference · 2007 · 16 citations · 5 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureFormal MethodsHardware Description LanguagesEquivalence CheckingHardware Modeling For Digital SystemsMemory ModelingModel CheckingTiming ModelingType CheckingHardware Equivalence CheckingHardware Model CheckingMemory MappingRtl VerificationSystem Architecture Specification
When designers create RTL models from a system-level specification, arrays in the system-level model are often implemented as memories in the RTL. Knowing the correspondence between ESL arrays and RTL memories can significantly reduce the complexity of a formal equivalence check between the ESL model and the RTL. In practice, however, handling memory mappings in ESL-RTL equivalence checking is non-trivial for the following reasons: First, because of a lack of bit-accurate data-types in the systemlevel language, the information stored in an array location may be stored in a compressed form in the RTL. Second, a single array in the ESL model may be implemented by multiple memories in the RTL and/or corresponding data items may be stored in different locations. And last but not least, due to timing differences between the ESL model and the RTL, the correspondence between arrays and memories may not hold in every clock cycle. In this paper, we propose an approach to ESL-RTL equivalence checking which can deal with all of these difficulties.
5
Towards a Mathematical Science of Computation.
John McCarthy · 1962 · 454 citations
A decision procedure for an extensional theory of arrays
Aaron Stump, Clark Barrett, David L. Dill et al. · 2002 · 136 citations