Casm

Abstract

In this paper we present CASM, a language based on Abstract State Machines (ASM), and its optimizing compiler. ASM is a welldefined (formal) method based on algebraic concepts. A distinct feature of ASM is its combination of parallel and sequential execution semantics. This makes it an excellent choice to formally specify and verify micro-architectures. We present a compilation scheme and an implementation of a runtime system supporting efficient execution of ASM. After introducing novel analysis techniques we present optimizations allowing us to eliminate many costly operations.Benchmark results show that our baseline compiler is 2-3 magnitudes faster than other ASM implementations. The optimizations further increase the performance of the compiled programs up to 264%. The achieved performance allows our ASM implementation to be used with industry-size applications.

A journey with ASMETA from requirements to code: application to an automotive system with adaptive features

“…Besides ASMETA tools, there are others that have been developed over the years around the ASMs. Among those, CoreASM [30] and CASM [36] are currently actively supported, while others, as the AsmGofer [41], are dead projects. CoreASM was designed and developed at the same time when the ASMETA project started and shares with AS-META the same overall goals of being a toolset for ASM editing, simulation, and verification.…”