Pith. sign in

Reference change · event page

Reference changes · DOI

3 Daphna Amit, Noam Rinetzky, Thomas W

Published notice on a work cited in the Pith corpus. Exact quotes below. No model judges whether any citation was load-bearing.

This page records that a citing paper's bibliography includes a work with a published notice. It is not a judgment on the citing paper.

Correction Crossref 1 open · 1 total · 0 disputed
DOI
10.1007/s10009-016-0415-4
Notice DOI
10.1007/s10009-021-00629-9
Event date
2021-05-31
Machine twin
JSON

01One-hop citing occurrences

Correction Open
Mechanized Metatheory of Forward Reasoning for End-to-End Linearizability Proofs

ref [2017] · 2509.06872 · notice #8438 · dispute

Raw extraction · citation context

The existence of refinement mappings.Theoretical Computer Science, 82(2):253-284, 1991. 2 Parosh Aziz Abdulla, Frédéric Haziza, Lukáš Holík, Bengt Jonsson, and Ahmed Rezine. An integrated specification and verification technique for highly concurrent data structures. International Journal on Software Tools for Technology Transfer, 19(5):549-563, Oct 2017. doi:10.1007/s10009-016-0415-4. 3 Daphna Amit, Noam Rinetzky, Thomas W. Reps, Mooly Sagiv, and Eran Yahav. Comparison under abstraction for verifying linearizability. In Werner Damm and Holger Hermanns, editors, Computer Aided Verification, 19th International Conference, CAV 2007, Berlin, Germany, July 3-7, 2007, Proceedings, volume 4590 ofLecture Notes in Computer Science, pages 477-490.

Parser render (TeX stripped for reading; raw above is the evidence)

The existence of refinement mappings.Theoretical Computer Science, 82(2):253-284, 1991. 2 Parosh Aziz Abdulla, Frédéric Haziza, Lukáš Holík, Bengt Jonsson, and Ahmed Rezine. An integrated specification and verification technique for highly concurrent data structures. International Journal on Software Tools for Technology Transfer, 19(5):549-563, Oct 2017. doi:10.1007/s10009-016-0415-4. 3 Daphna Amit, Noam Rinetzky, Thomas W. Reps, Mooly Sagiv, and Eran Yahav. Comparison under abstraction for verifying linearizability. In Werner Damm and Holger Hermanns, editors, Computer Aided Verification, 19th International Conference, CAV 2007, Berlin, Germany, July 3-7, 2007, Proceedings, volume 4590 ofLecture Notes in Computer Science, pages 477-490

Status lifecycle on notices: open → disputed → (response attached on the notice page). Repaired counts matter as much as open counts. There is no “safe,” “invalid,” or “resolved” badge.