We propose a debugging method for data-path intensive systems, in particular, memory systems. The approach is based on strengthening invariants by deriving constraints on data in the design using symbolic simulation with constrained inputs. A new heuristic is introduced for finding the appropriate input constraints for the symbolic simulation. We give up soundness in order to gain more automation and efficiency, minimizing or even eliminating the required manual effort. While it is no longer possible to prove the correctness of the design, experimental results demonstrate that the technique is quite effective in finding design errors. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Abu-Haimed, H., Berezin, S., & Dill, D. L. (2003). Semi-formal verification of memory systems by symbolic simulation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2860, 158–163. https://doi.org/10.1007/978-3-540-39724-3_15
Mendeley helps you to discover research relevant for your work.