Reasoning about Optimistic Concurrency Using a Program Logic for History

  title={Reasoning about Optimistic Concurrency Using a Program Logic for History},
  author={Ming Fu and Yong Li and Xinyu Feng and Zhong Shao and Yu Zhang},
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and rely-guarantee reasoning can be used to verify these algorithms, but they make heavy uses of history variables which may obscure the high-level intuition underlying the design of these algorithms. In this paper, we propose a novel program logic that uses invariants on history traces to reason about optimistic… CONTINUE READING


Publications citing this paper.

82 Citations

Citations per Year
Semantic Scholar estimates that this publication has 82 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…