Searching for authors named James Huggins – sorted by Relevance.
26 documents found, showing 1 through 10.
Next 10 →
-
Kermit: Specification and Verification
- …fies property \Phi" and are proved by induction on relevant runs. It is usually obvious that relevant initial states satisfy \Phi; more work is required to show that the transition rules preserve \Phi. The liveness theorems have the form "Every fair run has such and such property." Acknowledgments.…
- Cited by 11 (0 self) – Add To MetaCart
-
Modular Term-Long Cs2 Projects
- …We present a model for a term-long CS2 project which emphasizes modular code development and codereuse while providing the opportunity to cover many traditional CS2 concepts. The project focuses on the construction of a simplified database system. The project is composed of a series of smaller assig…
- Add To MetaCart
-
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.…
- Cited by 5 (0 self) – Add To MetaCart
-
Abstract State Machines 1988-1998: Commented ASM Bibliography
- …The attempt to answer the question in a more concrete way led the two authors of this commented bibliography to systematically review again, revising and updating [20], what are the achievements and failures of ASM research since the discovery of the notion by Yuri Gurevich in 1988. What follows her…
- Cited by 18 (1 self) – Add To MetaCart
-
Broy-Lamport Specification Problem: A Gurevich Abstract State Machine Solution
- …State Machine Solution James K. Huggins y EECS Department, University of Michigan, Ann Arbor, MI, 48109-2122, USA. December 19, 1996 Abstract We apply the Gurevich Abstract State Machine methodology to a benchmark specification problem of Broy and Lamport. As part of the Dagstuhl Workshop on R…
- Cited by 1 (0 self) – Add To MetaCart
-
The Static and Dynamic Semantics of C
- …Montages are a semi-visual formalism for defining the static and dynamic semantics of a programming language using Gurevich's Abstract State Machines (ASMs). We describe an application of Montages to describe the static and dynamic semantics of the C programming language.…
- Cited by 5 (0 self) – Add To MetaCart
-
An Abstract State Machine Primer
- …State Machines (ASMs) have been used to describe and validate a wide variety of computing systems [9]. Numerous introductions to ASMs have been written (see for example [20, 10, 21, 36]). In addition, many ASM papers include brief overviews for the casual reader. In this paper we attempt to provide …
- Cited by 4 (0 self) – Add To MetaCart
-
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…
- Cited by 5 (1 self) – Add To MetaCart
-
Evolving Algebras and Partial Evaluation
- …We describe an automated partial evaluator for evolving algebras implemented at the University of Michigan.…
- Cited by 4 (1 self) – Add To MetaCart
-
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. 1 Introduction The well-known railroad cross…
- Cited by 25 (2 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
