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
A methodology for implementing highly concurrent data objects
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
ESOP '86 Proceedings of the European Symposium on Programming
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
Using eternity variables to specify and prove a serializable database interface
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
An assertional proof for a construction of an atomic variable
Formal Aspects of Computing
Eternity variables to prove simulation of specifications
ACM Transactions on Computational Logic (TOCL)
Efficient Wait-Free Implementation of Multiword LL/SC Variables
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Refinement verification of the lazy caching algorithm
Acta Informatica
Lock-free parallel and concurrent garbage collection by mark&sweep
Science of Computer Programming
A general lock-free algorithm using compare-and-swap
Information and Computation
A criterion for atomicity revisited
Acta Informatica
Universal extensions to simulate specifications
Information and Computation
A challenge for atomicity verification
Science of Computer Programming
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
VSTTE'10 Proceedings of the Third international conference on Verified software: theories, tools, experiments
Simulation refinement for concurrency verification
Science of Computer Programming
| Hi-index | 0.00 |
In recent years, we extended the theory of Abadi and Lamport (1991) on the existence of refinement mappings. The present paper gives an overview of several extensions of the theory and of a number of recent applications to practical verifications. It concludes with a sketch of the results on semantic completeness, and a discussion of the relationship between semantic completeness and methodological convenience.