Proc. of the European symposium on programming on ESOP 86
A computational logic handbook
A computational logic handbook
A simple approach to specifying concurrent systems
Communications of the ACM
The existence of refinement mappings
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Forward and backward simulations I.: untimed systems
Information and Computation
Invariants for the construction of a handshake register
Information Processing Letters
Reduction: a method of proving properties of parallel programs
Communications of the ACM
Concurrency verification: introduction to compositional and noncompositional methods
Concurrency verification: introduction to compositional and noncompositional methods
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Simulations Between Specifications of Distributed Systems
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
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)
Distributed Computing - Special issue: Specification of concurrent systems
Algebraic and functional specification of an interactive serializable database interface
Distributed Computing - Special issue: Specification of concurrent systems
Critique of the lake arrowhead three
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
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)
Universal extensions to simulate specifications
Information and Computation
Simulation Refinement for Concurrency Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
Completeness of ASM Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Mechanically verified proof obligations for linearizability
ACM Transactions on Programming Languages and Systems (TOPLAS)
Simulation refinement for concurrency verification
Science of Computer Programming
Completeness of fair ASM refinement
Science of Computer Programming
Simplifying linearizability proofs with reduction and abstraction
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Note: Finite and infinite implementation of transition systems
Theoretical Computer Science
| Hi-index | 0.00 |
Simulations of specifications are introduced as a unification and generalization of refinement mappings, history variables, forward simulations, prophecy variables, and backward simulations. A specification implements another specification if and only if there is a simulation from the first one to the second one that satisfies a certain condition. By adding stutterings, the formalism allows that the concrete behaviors take more (or possibly less) steps than the abstract ones.Eternity variables are introduced as a more powerful alternative for prophecy variables and backward simulations. This formalism is semantically complete: every simulation that preserves quiescence is a composition of a forward simulation, an extension with eternity variables, and a refinement mapping. This result does not need finite invisible nondeterminism and machine closure as in the Abadi--Lamport Theorem. The requirement of internal continuity is weakened to preservation of quiescence.Almost all concepts are illustrated by tiny examples or counter-examples.