Evolving algebras 1993: Lipari guide
Specification and validation methods
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Sequential abstract-state machines capture sequential algorithms
ACM Transactions on Computational Logic (TOCL)
Modular design for the Java virtual machine architecture
Architecture design and validation methods
Flow diagrams, turing machines and languages with only two formation rules
Communications of the ACM
The Universal Computer: The Road from Leibniz to Turing
The Universal Computer: The Road from Leibniz to Turing
An ASM Semantics for UML Activity Diagrams
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
High Level System Design and Analysis Using Abstract State Machines
FM-Trends 98 Proceedings of the International Workshop on Current Trends in Applied Formal Method: Applied Formal Methods
XASM - An Extensible, Component-Based ASM Language
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
Modular decomposition of automata
Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity
A Logic for Abstract State Machines
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A compositional framework for service interaction patterns and interaction flows
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
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
Using the CASM language for simulator synthesis and model verification
Proceedings of the 2013 Workshop on Rapid Simulation and Performance Evaluation: Methods and Tools
| Hi-index | 0.00 |
We define three composition and structuring concepts which reflect frequently used refinements of ASMs and integrate standard structuring constructs into the global state based parallel ASM view of computations. First we provide an operator which combines the atomic update view of ASMs with sequential machine execution and naturally incorporates classical iteration constructs into ASMs. For structuring large machines we define their parameterization, leading to a notion of possibly recursive submachine calls which sticks to the bare logical minimum needed for sequential ASMs, namely consistency of simultaneous machine operations. For encapsulation and state hiding we provide ASMs with local state, return values and error handling. Some of these structuring constructs have been implemented in ASM-Gofer. We provide also a proof-theoretic definition which supports the use of common structured proof principles for proving properties for complex machines in terms of properties of their components.