Nothing Special   »   [go: up one dir, main page]
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Programming Languages

arXiv:2209.13692 (cs)
[Submitted on 27 Sep 2022 (v1), last revised 21 Apr 2023 (this version, v3)]

Title:Embedding Hindsight Reasoning in Separation Logic

Authors:Roland Meyer, Thomas Wies, Sebastian Wolff
View PDF
Abstract:Proving linearizability of concurrent data structures remains a key challenge for verification. We present temporal interpolation as a new proof principle to conduct such proofs using hindsight arguments within concurrent separation logic. Temporal reasoning offers an easy-to-use alternative to prophecy variables and has the advantage of structuring proofs into easy-to-discharge hypotheses. To hindsight theory, our work brings the formal rigor and proof machinery of concurrent program logics. We substantiate the usefulness of our development by verifying the linearizability of the Logical Ordering (LO-)tree and RDCSS. Both of these involve complex proof arguments due to future-dependent linearization points. The LO-tree additionally features complex structure overlays. Our proof of the LO-tree is the first formal proof of this data structure. Interestingly, our formalization revealed an unknown bug and an existing informal proof as erroneous.
Subjects: Programming Languages (cs.PL); Logic in Computer Science (cs.LO)
Cite as: arXiv:2209.13692 [cs.PL]
  (or arXiv:2209.13692v3 [cs.PL] for this version)
  https://doi.org/10.48550/arXiv.2209.13692
Journal reference: Proc. ACM Program. Lang. 7, PLDI, Article 182 (June 2023), 24 pages
Related DOI: https://doi.org/10.1145/3591296

Submission history

From: Sebastian Wolff [view email]
[v1] Tue, 27 Sep 2022 21:10:36 UTC (124 KB)
[v2] Wed, 5 Apr 2023 20:22:24 UTC (153 KB)
[v3] Fri, 21 Apr 2023 18:25:05 UTC (143 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.PL
< prev   |   next >
new | recent | 2022-09
Change to browse by:
cs
cs.LO

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)