CASM - Optimized Compilation of Abstract State Machines

Roland Lezuo, Philipp Paulweber, Andreas Krall
June 12, 2014
Digital Printed Source Abstract View Cite
Type
Conference paper
Publication
ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES’14)

Abstract

In this paper we present CASM, a language based on Abstract State Machines (ASM), and its optimizing compiler. ASM is a well-defined (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.

Document

Reference

% BibTex
@inproceedings{lezuo2014lctes,
  title        = {{CASM - Optimized Compilation of Abstract State Machines}},
  author       = {Lezuo, Roland and Paulweber, Philipp and Krall, Andreas},
  booktitle    = {ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES'14)},
  series       = {978-1-4503-2877-7},
  pages        = {13--22},
  year         = {2014},
  organization = {ACM}
}
CASM

Related