Object-based abstract state machines

This report explains basic notions and concepts of Abstract State Machines (ASM) as well as notation for defining ASM models. The objective here is to provide an intuitive understanding of the formalism; for a rigorous definition of the mathematical foundations of ASM, the reader is referred to [2] and [3]. Further references on ASM-related material can be found on the ASM Web Pages [1].

: This codeless method of programming using ASMs is not only capable of producing transparent software but reliable, proven and checked, all the way through its specification as ground model to its implementation. In other words evolving algebra method supports all the software life-cycle phases from initial specifications or requirement gathering to executable code. Above all, this method is platform independent and the ease with which computer scientist can build simple and clean system models out of evolving algebra pushes further the potential it needs to influence future industrial formal methods techniques. This formal specifications and designs demonstrate the consistency between the specifications and the code for all possible data inputs at various levels of abstractions.

Lecture Notes in Computer Science, 2016

The paper presents our efforts in defining UASM, a unified syntax for Abstract State Machines (ASMs), based on the syntaxes of two of the main ASM frameworks, CoreASM and ASMETA, which have been adapted to accept UASM as input syntax of all their validation and verification tools.

2000

Our goal is to provide a rigorous method, clear notation and convenient tool support for high-level system design and analysis. For this purpose we use abstract state machines (ASMs). Here we describe a particular case study: modeling a debugger of a stack based runtime environment. The study provides evidence for ASMs being a suitable tool for building executable models of software systems on various abstraction levels, with precise refinement relationships connecting the models.

Innovations in Systems and Software Engineering, 2009

In this paper the author uses Alloy as a modeling language to model the elements that form a state machine and the rules that govern how they can be connected. In particular, the model proposed in this paper focuses in the static aspects of state machines. To analyze and detect design errors in the model, the Alloy analyzer was used. With the use of this tool, design errors can be detected very quickly. This tool can also generate instances of the model without making a line of code. The paper presents two models based on the formal approach: a graphical model and a textual model. The graphical model is used as an overview of the system while the textual model is used to establish further constraints on the graphical model.

2005

In this paper we model as Abstract State Machines (ASMs) some object-oriented design patterns, which have been introduced in [12] in the context of object-oriented programmming principles. We hope to trigger by this work some investigation of genuine modeling patterns, which are placed at a higher level of abstraction than object-oriented class structures and related programming structures.

2015

This paper introduces techniques for specifying behavior, architecture, and abstract properties of large scale computer software and hardware purely in terms of ordinary deterministic state machines. The goal is to be able to work with specifications ranging from operating systems to databases and real-time control. State machines with output are represented as maps from finite sequences of events to outputs so that f(s) is the output in the state reached by following s from a initial state. Composite sequence maps correspond to state machine products. The methods used here can specify or constrain both system behavior and system design. Motivating examples presented range from simple counters to distributed consensus algorithms and real-time circuits. The approach is intended to facilitate "back of the envelope" descriptions of devices and software and also to allow for detailed hierarchical specifications of behavior and architecture. The mathematical approach is based o...

TAPSOFT '91, 1991

The conceptual modeling of the Universe of Discourse (UoD) is an important phase for the development of information systems because the conceptual model is the basis for system development. Conceptual model specifications must be formal in order to be precise and unambiguous and to support consistency and completeness checks. The object-oriented paradigm is suitable for providing an integrated formal description of all relevant static and dynamic aspects of the UoD structured in objects. In this paper we introduce a formal concept of object suitable to represent the UoD by a collection of concurrent interacting objects. The Obtog+-tanguage for object-oriented UoD-specification based on this concept supports the integrated description of data about objects, the development of objects through time and of various relationships between objects taldng into account static and dynamic aspects of object interaction.

In this work we propose an extension to the original model of Abstract State Machines. We focus on the modularization support and on the explicit interaction abstraction between the modules units of speci cation. We provide the new language syntax and semantics, and also the speci cation of the Alternating Bit Protocol using the proposed method.

2005

Abstract In this paper we present a language for Abstract State Machine specifications. The ASM metamodel (AsmM), introduced in [18], is a MOF-compliant metamodel representing in an abstract and visual way the concepts and constructs of the ASMs formalism as described in [3]. Here we present a concrete syntax (AsmM-CS), an EBNF (extended Backus-Naur Form) grammar derived from the AsmM as a textual notation to be used by modelers to effectively write ASM models complaint with AsmM.