Proc. of the European symposium on programming on ESOP 86
The existence of refinement mappings
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Forward and backward simulations I.: untimed systems
Information and Computation
Reduction: a method of proving properties of parallel programs
Communications of the ACM
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 prove simulation of specifications
ACM Transactions on Computational Logic (TOCL)
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
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Using eternity variables to specify and prove a serializable database interface
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
Eternity variables to prove simulation of specifications
ACM Transactions on Computational Logic (TOCL)
Knowledge-Based Asynchronous Programming
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Universal extensions to simulate specifications
Information and Computation
Completeness of ASM Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Completeness of fair ASM refinement
Science of Computer Programming
Knowledge-Based Asynchronous Programming
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Specification and Verification of Concurrent Programs Through Refinements
Journal of Automated Reasoning
| Hi-index | 0.03 |
Simulation of specifications is introduced as a unification and generalisation of refinement mappings, history variables, forward simulations, prophecy variables, and backward simulations.Eternity variables are introduced as a more powerful alternative for prophecy variables and backward simulations. This formalism is semantically complete: every simulation is a composition of a forward simulation, an extension with eternity variables, and a refinement mapping. The finiteness and continuity conditions of the Abadi-Lamport Theorem are unnecessary for this result.