Proving linearizability with temporal logic
- Linearizability is a correctness criterion for concurrent systems. In this report, we describe how temporal logic can be used to prove linearizability of a concurrent lock-free stack implementation. The logic used is an extended variant of Interval Temporal Logic, which is integrated in the KIV interactive theorem prover. To reduce the proof to single components only a compositional reasoning technique is used.
