Symbolic Simulation of Microprocessor Models using Type Classes in Haskell

Authors:
Nancy A. Day;Jeffrey R. Lewis;Byron Cook
Affiliations:
-;-;-
Venue:
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Year:
1999

Citing 8
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Lava: hardware design in Haskell

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Multiway Decision Graphs for Automated Hardware Verification

Formal Methods in System Design
Symbolic Simulation: An ACL2 Approach

FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
Symbolic Simulation of the JEM1 Microprocessor

FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
Symbolic Functional Evaluation

TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Microprocessor Specification in Hawk

ICCL '98 Proceedings of the 1998 International Conference on Computer Languages
Symbolic Simulation of Microprocessor Models using TypeClasses in Haskell

Symbolic Simulation of Microprocessor Models using TypeClasses in Haskell

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.