Flexible Instruction-Set Semantics via Abstract Monads (Experience Report)
Citations Over Time
Abstract
Instruction sets, from families like x86 and ARM, are at the center of many ambitious formal-methods projects. Many verification, synthesis, programming, and debugging tools rely on formal semantics of instruction sets, but different tools can use semantics in rather different ways. The best-known work applying single semantics across diverse tools relies on domain-specific languages like Sail, where the language and its translation tools are specialized to the realm of instruction sets. In the context of the open RISC-V instruction-set family, we decided to explore a different approach, with semantics written in a carefully chosen subset of Haskell. This style does not depend on any new language translators, relying instead on parameterization of semantics over type-class instances. We have used a single core semantics to support testing, interactive proof, and model checking of both software and hardware, demonstrating that monads and the ability to abstract over them using type classes can support pleasant prototyping of ISA semantics.
Related Papers
- Semantics With Applications: A Formal Introduction(1992)
- → ON FORMAL AND COGNITIVE SEMANTICS FOR SEMANTIC COMPUTING(2010)77 cited
- → Semantics of communicating processes(1984)21 cited
- → Equivalence of formal semantics definition methods(1997)
- Equivalence proving of operational and denotational semantics about Repeat-until statement(2006)