We present a technique for doing symbolic simulation of microprocessor models in the functional programming language Haskell. We use polymorphism and the type class system, a unique feature of Haskell, to write models that work over both concrete and symbolic data. We offer this approach as an alternative to using uninterpreted constants. When the full generality of rewriting is not needed, the performance of symbolic simulation by evaluation is much faster than previously reported symbolic simulation efforts in theorem provers.
CITATION STYLE
Day, N. A., Lewis, J. R., & Cook, B. (1999). Symbolic simulation of microprocessor models using type classes in Haskell. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1703, pp. 346–349). Springer Verlag. https://doi.org/10.1007/3-540-48153-2_31
Mendeley helps you to discover research relevant for your work.