The research belonging to the Abstract State Machines approach to system design and analysis is surveyed and documented in an annotated ASM bibliography. The survey covers the period from 1984, when the idea for the concept of ASMs (under the name dynamic or evolving algebras or structures) appears for the first time in a foundational context, to the year 2001 where a mathematically well-founded, practical system development method based upon the notion of ASMs is in place and ready to be industrially deployed. Some lessons for the future of ASMs are drawn
Abstract State Machines (ASM) have been introduced as “a computation model that is more powerful and...
... we should have achieved a mathematical model of computation, perhaps highly abstract in contrast...
Abstract: In this paper we present CASM, a general purpose programming language based on abstract st...
In this paper we give an answer to the often asked question what charac-terizes the Abstract State M...
AbstractThe background and the themes of this ASM-centered special issue of TCS are briefly describe...
The background and the themes of this ASM-centered special issue of TCS are shortly described
The ASM approach has gained a maturity that permits the use of ASM as the foundation for all computa...
Over the last twenty years, Abstract State Machines (ASMs) have been used to describe and validate a...
by “an alternative computation model which explicitly recognizes finiteness of computers ” (Gurevich...
The attempt to answer the question in a more concrete way led the two authors of this commented bibl...
Abstract: We survey applications of the Abstract State Machines (ASM) method for high-level system m...
Along the years, Abstract State Machines (ASMs) have been successfully applied for modeling critica...
How can one cope with the notorious problem of establishing the correctness and completeness of abst...
In this paper we show how to integrate the use of Gurevich s Abstract State Machines (ASMs) into a c...
Abstract state machines (originally called evolving algebras) constitute a modern computation model ...
Abstract State Machines (ASM) have been introduced as “a computation model that is more powerful and...
... we should have achieved a mathematical model of computation, perhaps highly abstract in contrast...
Abstract: In this paper we present CASM, a general purpose programming language based on abstract st...
In this paper we give an answer to the often asked question what charac-terizes the Abstract State M...
AbstractThe background and the themes of this ASM-centered special issue of TCS are briefly describe...
The background and the themes of this ASM-centered special issue of TCS are shortly described
The ASM approach has gained a maturity that permits the use of ASM as the foundation for all computa...
Over the last twenty years, Abstract State Machines (ASMs) have been used to describe and validate a...
by “an alternative computation model which explicitly recognizes finiteness of computers ” (Gurevich...
The attempt to answer the question in a more concrete way led the two authors of this commented bibl...
Abstract: We survey applications of the Abstract State Machines (ASM) method for high-level system m...
Along the years, Abstract State Machines (ASMs) have been successfully applied for modeling critica...
How can one cope with the notorious problem of establishing the correctness and completeness of abst...
In this paper we show how to integrate the use of Gurevich s Abstract State Machines (ASMs) into a c...
Abstract state machines (originally called evolving algebras) constitute a modern computation model ...
Abstract State Machines (ASM) have been introduced as “a computation model that is more powerful and...
... we should have achieved a mathematical model of computation, perhaps highly abstract in contrast...
Abstract: In this paper we present CASM, a general purpose programming language based on abstract st...