The ASM refinement method
E Börger - Formal aspects of computing, 2003 - Springer
Formal aspects of computing, 2003•Springer
In this paper the abstract state machine (ASM) refinement method is presented. Its
characteristics compared to other refinement approaches in the literature are explained.
Some frequently occurring forms of ASM refinements are identified and illustrated by
examples from the design and verification of architectures and protocols, from the semantics
and the implementation of programming languages and from requirements engineering.
characteristics compared to other refinement approaches in the literature are explained.
Some frequently occurring forms of ASM refinements are identified and illustrated by
examples from the design and verification of architectures and protocols, from the semantics
and the implementation of programming languages and from requirements engineering.
Abstract
In this paper the abstract state machine (ASM) refinement method is presented. Its characteristics compared to other refinement approaches in the literature are explained. Some frequently occurring forms of ASM refinements are identified and illustrated by examples from the design and verification of architectures and protocols, from the semantics and the implementation of programming languages and from requirements engineering.
Springer