Abstract state machines: a unifying view of models of computation and of system design frameworks

DOI10.1016/j.apal.2004.10.007zbMath1066.68047OpenAlexW1999884249MaRDI QIDQ1772776

Egon Börger

Publication date: 21 April 2005

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2004.10.007

zbMATH Keywords

computation theorymodels of computation

Mathematics Subject Classification ID

Related Items (5)

A Module System for Domain-Specific Languages ⋮ Can abstract state machines be useful in language theory? ⋮ Programs=data=first-class citizens in a computational world ⋮ Work-sensitive dynamic complexity of formal languages ⋮ A high-level modular definition of the semantics of C\(_{\sharp}\)

Uses Software

• Z
• UNITY

Cites Work

• Computability, complexity, logic. Transl. from the German
• A theory of timed automata
• Specification and correctness proof of a WAM extension with abstract type constraints
• Refinement of a typed WAM extension by polymorphic order-sorted types
• A mathematical definition of full Prolog
• Some definitional suggestions for automata theory
• The B-Book
• Abstract State Machines
• Evolving Algebras 1993: Lipari Guide
• Formal Specification and Design
• Flow diagrams, turing machines and languages with only two formation rules
• The structure of the “THE”-multiprogramming system
• Sequential abstract-state machines capture sequential algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Abstract state machines: a unifying view of models of computation and of system design frameworks