(Enter summary)
Abstract: Simulation of specifications is introduced as a unification
and generalization of refinement mappings, history variables, forward
simulations, prophecy variables, and backward simulations. (Update)
Context of citations to this paper: More
...Instead of this, we invented another kind of auxiliary variables with prescient behaviour, so called eternity variables. In [7, 8], we show that the verification method based on eternity variables in combination with forward simulations is semantically complete, in a...
Cited by: More
Universal Extensions to Simulate Specifications - Wim Hesselink Th (2004)
(Correct)
Using Eternity Variables to Specify and Prove a Serializable.. - Hesselink (2003)
(Correct)
Active bibliography (related documents): More All
0.5: Eternity Variables to Simulate Specifications - Hesselink (2002)
(Correct)
0.2: A Conceptual Framework for Object Composition and Behavior.. - Page Framework
(Correct)
0.1: Characterization of a Sequentially Consistent Memory and.. - Graf (1995)
(Correct)
Similar documents based on text: More All
0.8: Forward and Backward Simulations - Part I: Untimed Systems - Lynch, Vaandrager (1994)
(Correct)
0.5: Invariants for Bloom's register - Hesselink (1999)
(Correct)
0.5: The Existence of Refinement Mappings - Abadi, Lamport (1988)
(Correct)
Related documents from co-citation: More All
2: Temporal Verification of Reactive Systems : Safety (context) - Manna, Pnueli - 1995
2: Eternity variables to prove simulation of specifications (context) - Hesselink
2: The existence of refinement mappings
- Abadi, Lamport - 1991
BibTeX entry: (Update)
Hesselink, W.H.: Eternity variables to simulate specifications. In: E.A. Boiten, B. Moller (eds.): Mathematics of Program Construction. Proceedings MPC 2002. http://citeseer.ist.psu.edu/article/hesselink02eternity.html More
@misc{ hesselink02eternity,
author = "W. Hesselink",
title = "Eternity variables to simulate specifications",
text = "Hesselink, W.H.: Eternity variables to simulate specifications. In: E.A.
Boiten, B. Moller (eds.): Mathematics of Program Construction. Proceedings
MPC 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/article/hesselink02eternity.html" }
Citations (may not include all citations):
274
The existence of refinement mappings
- Abadi, Lamport - 1991 ACM DBLP
168
ACM Transactions on Programming Languages and Systems (context) - Abadi, Lamport - 1995
106
An algebraic definition of simulation between programs (context) - Milner - 1971 ACM DBLP
97
Information and Computation (context) - Lynch, Vaandrager et al. - 1995 DBLP
62
Reduction: a method of proving properties of parallel progra.. (context) - Lipton - 1975 DBLP
45
on Programming Languages and Systems (context) - Lamport - 1994
44
Data refinement refined (context) - He, Hoare et al. - 1986 ACM DBLP
36
Simulations between specifications of distributed systems (context) - Jonsson - 1991 ACM DBLP
15
Reduction in TLA
- Cohen, Lamport - 1998 ACM DBLP
8
Proving refinement using transduction
- Jonsson, Pnueli et al. - 1999 DBLP
4
Critique of the Lake Arrowhead three
- Lamport - 1992 DBLP
www.cs.rug.nl/~wim/pub/whh261.pdf
Documents on the same site (http://www.cs.rug.nl/~wim/pub/index.html): More
An Assertional Criterion for Atomicity - Hesselink (2001)
(Correct)
A mechanical proof of Segall's PIF algorithm - Hesselink (1997)
(Correct)
The Design of a Linearization of a Concurrent Data Object - Hesselink
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC