The formal execution semantics of SpecC

  • Authors:
  • Wolfgang Mueller;Rainer Dömer;Andreas Gerstlauer

  • Affiliations:
  • Paderborn University, Paderborn, Germany;University of California, Irvine, USA;University of California, Irvine, USA

  • Venue:
  • Proceedings of the 15th international symposium on System Synthesis
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a rigorous but transparent semantics definition of the SpecC language that covers the execution of SpecC behaviors and their interaction with the kernel process. The semantics include wait, waitfor, par, and try statements as they are introduced in SpecC. We present our definition in form of distributed Abstract State Machine (ASM) rules strictly following the lines of the SpecC Language Reference Manual [4]. We mainly see our formal semantics in three application areas. First, it is a concise, unambiguous description for documentation and standardization. Second, it applies as a high--level, pseudo code--oriented specification for the implementation of a SpecC simulator. Finally, it is a first step for SpecC synthesis in order to identify similar concepts with other languages like VHDL and SystemC for the definition of common patterns and language subsets.