Constructing Two-Writer Atomic Registers
IEEE Transactions on Computers
Linearizability: a correctness condition for concurrent objects
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
Distributed Algorithms
ESOP '86 Proceedings of the European Symposium on Programming
Nonblocking algorithms and backward simulation
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Formal verification of a lazy concurrent list-based set algorithm
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
| Hi-index | 0.00 |
Backward simulation relations provide a technique for verifying computer systems modelled as labelled transition systems. Recent experience suggests that backward simulation relations are useful in the verification of some highly concurrent systems. Proofs by backward simulation are complicated by the need to show that the simulation relation is total over all reachable states of the system being verified. Some reachable states exhibit complex dependencies between components of the state. We present a technique that reduces proving totality on all reachable states, to proving totality on a subset of the reachable states that are very simple. The technique exploits a very weak property of concurrent systems that we call completability: a system is completable if every operation can finish, but not every operation is required to finish in every execution.