Evolving algebras 1993: Lipari guide
Specification and validation methods
Sequential abstract-state machines capture sequential algorithms
ACM Transactions on Computational Logic (TOCL)
Abstract State Machines: A Method for High-Level System Design and Analysis
Abstract State Machines: A Method for High-Level System Design and Analysis
Abstract state machines capture parallel algorithms
ACM Transactions on Computational Logic (TOCL)
The hidden computation steps of turbo abstract state machines
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
A high-level modular definition of the semantics of C#
Theoretical Computer Science - Abstract state machines and high-level system design and analysis
Modeling workflow patterns from first principles
ER'07 Proceedings of the 26th international conference on Conceptual modeling
On revival of Algol-concepts in modern programming and specification languages
Formal methods and hybrid real-time systems
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
| Hi-index | 0.00 |
The question raised in [15] is answered how to naturally model widely used forms of recursion by abstract machines. We show that turbo ASMs as defined in [7] allow one to faithfully reflect the common intuitive single-agent understanding of recursion. The argument is illustrated by turbo ASMs for Mergesort and Quicksort. Using turbo ASMs for returning function values allows one to seamlessly integrate functional description and programming techniques into the high-level 'abstract programming' by state transforming ASM rules.