CoreASM: An Extensible ASM Execution Engine

  • Authors:
  • Roozbeh Farahbod;Vincenzo Gervasi;Uwe Glässer

  • Affiliations:
  • School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada. E-mial: {rfarahbo,glasser}@cs.sfu.ca;Dipartimento di Informatica, Università di Pisa, Pisa, Italy. E-mail: gervasi@di.unipi.it;School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada. E-mial: {rfarahbo,glasser}@cs.sfu.ca

  • Venue:
  • Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we introduce a new research effort in making abstract state machines (ASMs) executable. The aim is to specify and implement an execution engine for a language that is as close as possible to the mathematical definition of pure ASMs. The paper presents the general architecture of the engine, together with a high-level description of the extensibility mechanisms that are used by the engine to accommodate arbitrary backgrounds, scheduling policies, and new rule forms.