Results 1 
6 of
6
Algebraic state machines
 Proc. 8th Internat. Conf. Algebraic Methodology and Software Technology, AMAST 2000. LNCS 1816
, 2000
"... Abstract. We introduce the concept of an algebraic state machine. This is a state transition machine all parts of that are described by algebraic and logical means. This way we base the description of state transition systems exclusively on the concept of algebraic specifications. Also the state of ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We introduce the concept of an algebraic state machine. This is a state transition machine all parts of that are described by algebraic and logical means. This way we base the description of state transition systems exclusively on the concept of algebraic specifications. Also the state of an algebraic state machine is represented by an algebra. In particular, we describe the state spaces of the state machine by algebraic techniques, and the state transitions by special axioms called transition rules. Then we show how known concepts from algebraic specifications can be used to provide a notion of parallel composition with asynchronous interaction for algebraic state machines. As example we introduce a notion of objectoriented component and show how algebraic state machines can formalize such components. 1
Language Definition and Implementation
 Australian Computer Science Communications
, 1989
"... Many languages have been designed to date, of which a large number have never been implemented and the majority are specified in a very imprecise manner. For a language to receive serious consideration among the computer science community, it generally must have been implemented after its design. Ho ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Many languages have been designed to date, of which a large number have never been implemented and the majority are specified in a very imprecise manner. For a language to receive serious consideration among the computer science community, it generally must have been implemented after its design. However, it is the matter of a precise definition which is often forgotten or ignored and yet it is one of the most important aspects of a language when considered in the context of the evolution of programming languages. The language definition is the vehicle by which the rules regarding syntax and semantics are clearly stated and conveyed. It allows for the comparison of languages independent of any implementation or machine architecture. Furthermore, by employing techniques with a formal basis, it is also possible to use the language definition as the source for the automatic generation of a language implementation. This strongly suggests that language designers should precisely define thei...
Interpretive Language Implementation From A Layered Operational Model
 IN PROC. 5TH INT. CONF ON COMPUTING AND INFORMATION
, 1993
"... This paper describes a technique for the automatic generation of an interpretive implementation for a programming language from a layered operational semantic description of the language. Layers in the semantic model represent levels of abstraction which correspond to the needs of various classes ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper describes a technique for the automatic generation of an interpretive implementation for a programming language from a layered operational semantic description of the language. Layers in the semantic model represent levels of abstraction which correspond to the needs of various classes of user of the semantic description (programmers, language designers, and so on). The layers are built one atop the other, with the innermost layer of the model being based on the algebraic specification of abstract data types. Different kinds of user can thus use the same language definition, examining it to differing levels of detail. The complete layered programming language definition can be submitted to a system which automatically generates an interpretive implementation of the language. The implementation will hence be consistent with the description of the language being used by each kind of user. In particular, this technique presents many advantages for language designers, ...
On Gurevich’s Theorem for Sequential ASM
"... AbstractState Machines have been introduced as “a computation model that is more powerful and more universal than standard computation models”, by Yuri Gurevich in 1985 ([Gur85]). ASM gained much attention as a specification method, in particular for the description of the semantics of programmin ..."
Abstract
 Add to MetaCart
AbstractState Machines have been introduced as “a computation model that is more powerful and more universal than standard computation models”, by Yuri Gurevich in 1985 ([Gur85]). ASM gained much attention as a specification method, in particular for the description of the semantics of programming languages, communication protocols, distributed algorithms, etc. Gurevich proved recently that a sequential algorithm must only meet a few, liberal requirements, to be representable as an ASM. We reformulate Gurevich’s requirements for sequential algorithms, as well as the semantics of ASMprograms and the proof of his main theorem. A couple of examples support and explain intuition and motivation of ASM.
Abstract State Machines for the Classroom – The Basics –
"... ... we should have achieved a mathematical model of computation, perhaps highly abstract in contrast with the concrete nature of paper and register machines, but such that programming languages are merely executable fragments of the theory... Robin Milner [17] Summary. Abstract State Machines (ASM) ..."
Abstract
 Add to MetaCart
(Show Context)
... we should have achieved a mathematical model of computation, perhaps highly abstract in contrast with the concrete nature of paper and register machines, but such that programming languages are merely executable fragments of the theory... Robin Milner [17] Summary. Abstract State Machines (ASM) have been introduced as “a computation model that is more powerful and more universal than standard computation models ” by Yuri Gurevich in 1985. Here we provide a bunch of intuitive and motivating arguments, and characteristic examples for (the elementary version of) ASM. The intuition of ASM as a formal framework for an amazingly liberal notion of algorithms is highlighted. Generalizing variants of the fundamental “sequential small step ” version of ASM are also considered.
Generating an Interpretive Language Implementation From a Layered Operational Model
"... This paper describes a technique for the automatic generation of an interpretive implementation for a programming language from a layered operational semantic description of the language. Layers in the semantic model represent levels of abstraction which correspond to the needs of various classes of ..."
Abstract
 Add to MetaCart
(Show Context)
This paper describes a technique for the automatic generation of an interpretive implementation for a programming language from a layered operational semantic description of the language. Layers in the semantic model represent levels of abstraction which correspond to the needs of various classes of user of the semantic description (programmers, language designers, and so on). The layers are built one atop the other, with the innermost layer of the model being based on the algebraic specification of abstract data types. Different kinds of user can thus use the same language definition, examining it to differing levels of detail. The complete layered programming language definition can be submitted to a system which automatically generates an interpretive implementation of the language. The implementation will hence be consistent with the description of the language being used by each kind of user. In particular, this technique presents many advantages for language designers, since aspe...