A previous paper introduced eternity variables as an alternative to the prophecy variables of Abadi and Lamport and proved the formalism to be semantically complete: every simulation F. K -> L that preserves quiescence contains a composition of a history extension, an extension with eternity variables, and a refinement mapping. This result is strengthened here in three ways. First, the assumption of preservation of quiescence is eliminated. Second, it is shown that the intermediate extension only depends on K, and is independent of L and F. Third, in order to accommodate implementation relations where the concrete specification (occasionally) does fewer steps than the abstract specification, we weaken the concept of simulation, in such a wa...
Eternity variables are introduced to specify and verify serializability of transactions of a distrib...
AbstractThe simulation preorder for labeled transition systems is defined locally, and operationally...
In this paper we define simulations up-to a preorder and show how we can use them to provide a coind...
AbstractA previous paper introduced eternity variables as an alternative to the prophecy variables o...
A previous paper introduced eternity variables as an alternative to the prophecy variables of Abadi ...
Simulations of specifications are introduced as a unification and generalization of refinement mappi...
Simulations of specifications are introduced as a unification and generalization of refinement map-p...
Simulation of specifications is introduced as a unification and generalization of refinement mapping...
In the literature, the conditions on history variables or forward simulations that are related to li...
We present a simulation-based proof method for liveness properties. Our method is based on simulatio...
This paper presents a technique for incrementally constructing safety specifications, abstract algor...
AbstractRewriting logic is a flexible and general logic to specify concurrent systems. To prove prop...
Concurrent and reactive programs are specified by their behaviours in the presence of a nondetermini...
Kleisli simulation is a categorical notion introduced by Hasuo to verifyfinite trace inclusion. They...
Abstract: We investigate the relationship between two approaches to modeling physical systems. On th...
Eternity variables are introduced to specify and verify serializability of transactions of a distrib...
AbstractThe simulation preorder for labeled transition systems is defined locally, and operationally...
In this paper we define simulations up-to a preorder and show how we can use them to provide a coind...
AbstractA previous paper introduced eternity variables as an alternative to the prophecy variables o...
A previous paper introduced eternity variables as an alternative to the prophecy variables of Abadi ...
Simulations of specifications are introduced as a unification and generalization of refinement mappi...
Simulations of specifications are introduced as a unification and generalization of refinement map-p...
Simulation of specifications is introduced as a unification and generalization of refinement mapping...
In the literature, the conditions on history variables or forward simulations that are related to li...
We present a simulation-based proof method for liveness properties. Our method is based on simulatio...
This paper presents a technique for incrementally constructing safety specifications, abstract algor...
AbstractRewriting logic is a flexible and general logic to specify concurrent systems. To prove prop...
Concurrent and reactive programs are specified by their behaviours in the presence of a nondetermini...
Kleisli simulation is a categorical notion introduced by Hasuo to verifyfinite trace inclusion. They...
Abstract: We investigate the relationship between two approaches to modeling physical systems. On th...
Eternity variables are introduced to specify and verify serializability of transactions of a distrib...
AbstractThe simulation preorder for labeled transition systems is defined locally, and operationally...
In this paper we define simulations up-to a preorder and show how we can use them to provide a coind...