We explain the main ingredients of the Abstract State Machines (ASM) method for high-level
system design and analysis and survey some of its application highlights in industrial …

In this paper the abstract state machine (ASM) refinement method is presented. Its
characteristics compared to other refinement approaches in the literature are explained …

The proposed method provides this support by a combination of its abstraction concept and
its operational character: models come as behavioral models in the precise and simple form …

We introduce into and survey the ASM method for high-level system design and analysis.
We explain the three notions—Abstract State Machine [37], ASM ground model (system …

We propose a structured mathematical definition of the semantics of C♯ programs to
provide a platform-independent interpreter view of the language for the C♯ programmer …

Structures of Computing explains the behavioral meaning of fundamental concepts of
computing from a practical viewpoint and in generic terms, unrestricted by specific …

We propose a small set of parameterized abstract models for workflow patterns, starting from
first principles for sequential and distributed control. Appropriate instantiations yield the 43 …

Abstract State Machines: a unifying view of models of computation and of system design
frameworks Page 1 Annals of Pure and Applied Logic 133 (2005) 149–171 www.elsevier.com/locate/apal …

Abstract “What is an algorithm?” is a fundamental question of computer science. Gurevich's
behavioural theory of sequential algorithms (aka the sequential ASM thesis) gives a partial …

From the models provided in [14] and [4] for the semantics of Java and C# programs we
abstract the mathematical structure that underlies the semantics of both languages. The …