Can abstract state machines be useful in language theory?

Authors:
Yuri Gurevich;Charles Wallace
Affiliations:
Microsoft Research, Redmond, WA;Michigan Technological University, Houghton, MI
Venue:
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Year:
2006

Citing 6
Cited 0

Evolving algebras 1993: Lipari guide

Specification and validation methods
Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
Sequential abstract-state machines capture sequential algorithms

ACM Transactions on Computational Logic (TOCL)
Semantic essence of AsmL

Theoretical Computer Science - Formal methods for components and objects
Quantum computing and abstract state machines

ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
Interactive algorithms 2005

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract state machines (originally called evolving algebras) constitute a modern computation model [8]. ASMs describe algorithms without compromising the abstraction level. ASMs and ASM based tools have been used in academia and industry to give precise semantics for computing artifacts and to specify software and hardware [1, 2, 6]. In connection to the conference on Developments in Language Theory, we consider how and whether ASMs could be useful in language theory.