Searching for authors named "James Huggins" – sorted by Relevance.
22 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
-
The Assumptions of Computing
- …The use of computers, like any technological activity, is not content-neutral. Users of computers constantly interact with assumptions regarding worthwhile activity which are embedded in any computing system. Directly questioning these assumptions in the context of computing allows us to develop an …
- Add To MetaCart
-
Teaching ASMs, Teaching with ASMs: Opportunities in Undergraduate Education
- …State Machines (ASMs) [2] often cite their \easy learning" [12] and low degree of \formal overhead" [13] as points in favor of their use by systems developers. Recent achievements in automated tool support [3, 50] lend further credibility to ASMs as a programmer-friendly methodology. Yet there has b…
- 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
-
A Toolset for Supporting UML Static and Dynamic Model Checking
- …The Unified Modeling Language has become widely accepted as a standard in software development. Several tools have been produced to support UML model validation. However, most of them support either static or dynamic model checking; and no tools support to check both static and dynamic aspects of a …
- Cited by 11 (1 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
-
A Semantic Model for the State Machine in the Unified Modeling Language
- …State Machines can avoid this separation by unifying them into one model.…
- Cited by 4 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
