CASM - Optimized Compilation of Abstract State Machines

CASM - Optimized Compilation of Abstract State Machines

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.

Grafik Top
Authors
  • Lezuo, Roland
  • Paulweber, Philipp
  • Krall, Andreas
Grafik Top
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Full Paper in Proceedings)
Event Title
ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems
Divisions
Software Architecture
Subjects
Software Engineering
Programmiersprachen
Datenstrukturen
Rechnerarchitektur
Event Location
Edinburgh, UK
Event Type
Conference
Event Dates
12-13 June 2014
Series Name
LCTES '14 Proceedings of the 2014 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
ISSN/ISBN
978-1-4503-2877-7
Page Range
pp. 13-22
Date
June 2014
Official URL
http://dx.doi.org/10.1145/2597809.2597813
Export
Grafik Top