Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity

  title={Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity},
  author={Ilya Sergey and Aleksandar Nanevski and Anindya Banerjee},
We present a lightweight approach to Hoare-style specifications for fine-grained concurrency, based on a notion of time-stamped histories that abstractly capture atomic changes in the program state. Our key observation is that histories form a partial commutative monoid, a structure fundamental for representation of concurrent resources. This insight provides us with a unifying mechanism that allows us to treat histories just like heaps in separation logic. For example, both are subject to the… CONTINUE READING
Highly Cited
This paper has 43 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 15 times over the past 90 days. VIEW TWEETS


Publications citing this paper.
Showing 1-10 of 31 extracted citations

Similar Papers

Loading similar papers…