Using Abstract State Machines at Microsoft: A Case Study

Authors:
Michael Barnett;Egon Börger;Yuri Gurevich;Wolfram Schulte;Margus Veanes
Affiliations:
-;-;-;-;-
Venue:
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
Year:
2000

Citing 3
Cited 3

H/Direct: a binary foreign language interface for Haskell

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Calling hell from heaven and heaven from hell

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Essential COM

Essential COM

Domain-Specific Language for HW/SW Co-design for FPGAs

DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages
Yuri, logic, and computer science

Fields of logic and computation
Tutorial: the ASM method for system design and analysis. a tutorial introduction

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. High level ASM models of proposed or existing programs can be used throughout the software development cycle. In particular, ASMs can be used to model inter component behavior on any desired level of detail. This allows one to specify application programming interfaces more precisely than it is done currently.