Proc. of the European symposium on programming on ESOP 86
A simple approach to specifying concurrent systems
Communications of the ACM
The existence of refinement mappings
Theoretical Computer Science
Three logics for branching bisimulation
Journal of the ACM (JACM)
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Forward and backward simulations I.: untimed systems
Information and Computation
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Liveness-preserving simulation relations
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Simulations Between Specifications of Distributed Systems
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Generalizing Abadi & Lamport's Method to Solve a Problem Posed by A. Pnueli
FME '93 Proceedings of the First International Symposium of Formal Methods Europe on Industrial-Strength Formal Methods
Eternity Variables to Simulate Specifications
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Using eternity variables to specify and prove a serializable database interface
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
A theory of normed simulations
ACM Transactions on Computational Logic (TOCL)
Eternity variables to prove simulation of specifications
ACM Transactions on Computational Logic (TOCL)
Distributed Computing - Special issue: Specification of concurrent systems
Proving refinement using transduction
Distributed Computing - Special issue: Verification of lazy caching
Distributed Computing - Special issue: Verification of lazy caching
Refinement verification of the lazy caching algorithm
Acta Informatica
A criterion for atomicity revisited
Acta Informatica
Simulation Refinement for Concurrency Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
Completeness of ASM Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Refinement of State-Based Systems: ASMs and Big Commuting Diagrams (Abstract)
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Simulation refinement for concurrency verification
Science of Computer Programming
Completeness of fair ASM refinement
Science of Computer Programming
Hi-index | 0.00 |
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 way that it precisely corresponds to the implementation concept of Abadi and Lamport. We add stuttering history extensions to the repertoire of variable extensions, and show that this extended repertoire suffices to factorize an arbitrary (weakened) simulation. The proofs have been verified with the theorem prover PVS. The methodology of using eternity extensions in correctness proofs is briefly discussed.