Abstract State Machines 1988-1998: Commented ASM Bibliography
An annotated bibliography of papers which deal with or use Abstract State Machines (ASMs), as of January 1998.
cs.SE↗
arXiv subjects
James K. Huggins
Publications and source records attributed to James K. Huggins.
Broy-Lamport Specification Problem: A Gurevich Abstract State Machine Solution
We apply the Gurevich Abstract State Machine methodology to a benchmark specification problem of Broy and Lamport.
cs.SE↗
Equivalence is in the Eye of the Beholder
In a recent provocative paper, Lamport points out "the insubstantiality of processes" by proving the equivalence of two different decompositions of the same intuitive algorithm by means of temporal formulas. We point out that the correct equivalence of algorithms is itself in the eye of the beholder. We discuss a number of related issues and, in particular, whether algorithms can be proved equivalent directly.
cs.SE↗
Evolving Algebras and Partial Evaluation
We describe an automated partial evaluator for evolving algebras implemented at the University of Michigan.
cs.SE↗
An Offline Partial Evaluator for Evolving Algebras
We describe the architecture of an evolving algebra partial evaluator, a program which specializes an evolving algebra with respect to a portion of its input. We discuss the particular analysis, specialization, and optimization techniques used and show an example of its use.
cs.SE↗
The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions
We give an evolving algebra solution for the well-known railroad crossing problem and use the occasion to experiment with agents that perform instantaneous actions in continuous time and in particular with agents that fire at the moment they are enabled.
cs.SE↗