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.
CITATION STYLE
Börger, E. (2003). The ASM Refinement Method. In Formal Aspects of Computing (Vol. 15, pp. 237–257). https://doi.org/10.1007/s00165-003-0012-7
Mendeley helps you to discover research relevant for your work.