CoreASM: An Extensible ASM Execution Engine
Roozbeh Farahbod, Vincenzo Gervasi, Uwe Glässer
Abstract
Roozbeh Farahbod, Vincenzo Gervasi, Uwe Glässer
Abstract
In this paper we introduce a new research e#ort in making abstract state machines 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 ASM. 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.
OpenAlex reports 92 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper we introduce a new research e#ort in making abstract state machines 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 ASM. 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.
Key concepts: Abstract state machines, Extensibility, Executable, Computer science, Programming language, Architecture, State (computer science), Scheduling (production processes)