A Universal, Sound, and Complete Forward Reasoning Technique for Machine-Verified Proofs of Linearizability

We introduce simple, universal, sound, and complete proof methods for producing machine-verifiable proofs of linearizability and strong linearizability. Universality means that our method works for any object type; soundness means that an algorithm can be proved correct by our method only if it is l...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of ACM on programming languages Vol. 8; no. POPL; pp. 2456 - 2484
Main Authors: Jayanti, Prasad, Jayanti, Siddhartha, Yavuz, Ugur Y., Hernandez, Lizzie
Format: Journal Article
Language:English
Published: New York, NY, USA ACM 02.01.2024
Subjects:
Concurrent algorithms
Formal methods and theory of security
Logic and verification
Program verification
Security and privacy
Theory of computation
Linearizability
Universal
Verification
Forward Reasoning
Complete
ISSN:2475-1421, 2475-1421
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We introduce simple, universal, sound, and complete proof methods for producing machine-verifiable proofs of linearizability and strong linearizability. Universality means that our method works for any object type; soundness means that an algorithm can be proved correct by our method only if it is linearizable (resp. strong linearizable); and completeness means that any linearizable (resp. strong linearizable) implementation can be proved so using our method. We demonstrate the simplicity and power of our method by producing proofs of linearizability for the Herlihy-Wing queue and Jayanti's single-scanner snapshot, as well as a proof of strong linearizability of the Jayanti-Tarjan union-find object. All three of these proofs are machine-verified by TLAPS (the TLA+ Proof System).
AbstractList We introduce simple, universal, sound, and complete proof methods for producing machine-verifiable proofs of linearizability and strong linearizability. Universality means that our method works for any object type; soundness means that an algorithm can be proved correct by our method only if it is linearizable (resp. strong linearizable); and completeness means that any linearizable (resp. strong linearizable) implementation can be proved so using our method. We demonstrate the simplicity and power of our method by producing proofs of linearizability for the Herlihy-Wing queue and Jayanti's single-scanner snapshot, as well as a proof of strong linearizability of the Jayanti-Tarjan union-find object. All three of these proofs are machine-verified by TLAPS (the TLA+ Proof System).
ArticleNumber 82
Author Hernandez, Lizzie
Jayanti, Siddhartha
Jayanti, Prasad
Yavuz, Ugur Y.
Author_xml – sequence: 1
  givenname: Prasad
  orcidid: 0000-0002-8930-3467
  surname: Jayanti
  fullname: Jayanti, Prasad
  email: prasad.jayanti@dartmouth.edu
  organization: Dartmouth College, Hanover, USA
– sequence: 2
  givenname: Siddhartha
  orcidid: 0000-0002-2681-1632
  surname: Jayanti
  fullname: Jayanti, Siddhartha
  email: sjayanti@google.com
  organization: Google Research, Cambridge, USA
– sequence: 3
  givenname: Ugur Y.
  orcidid: 0000-0002-6218-2466
  surname: Yavuz
  fullname: Yavuz, Ugur Y.
  email: uyyavuz@bu.edu
  organization: Boston University, Boston, USA
– sequence: 4
  givenname: Lizzie
  orcidid: 0009-0000-1823-9990
  surname: Hernandez
  fullname: Hernandez, Lizzie
  email: lizziehv11@gmail.com
  organization: Microsoft, Redmond, USA
BookMark eNpt0E1LAzEQBuAgFay1ePeUm5euZpPNfhxLsSpUFG29LrObiY1uk5pslfrrrbSKiKcZ5n2Yw3tIOtZZJOQ4ZmdxnMhzkQpe8GSPdHmSyShOeNz5tR-QfgjPjLG4EEkuii55GdKZNW_oAzQD-uBWVg0oWEVHbrFssEU6dv4dvKL3CMFZY5_oFOu5Na8rpNp5egP13FiMHtEbbVDRO--cDtRpOtncwZsPqExj2vUR2dfQBOzvZo_MxhfT0VU0ub28Hg0nEfAsa6MsTxWTkqOsFGRKFHWa5xpTqaDQCEIkApEpnWcpFCkyqITKEUXFMVEy56JHou3f2rsQPOqyNi20xtnWg2nKmJVfZZW7sjb-9I9ferMAv_5Hnmwl1Isf9B1-Aj9Pc84
CitedBy_id crossref_primary_10_1145_3632924
Cites_doi 10.1145/69624.357207
10.1145/78969.78972
10.1145/2676726.2676963
10.1109/MC.1993.274940
10.1145/3498694
10.1145/3632924
10.1145/2933057.2933108
10.1016/0304-3975(91)90224-P
10.2168/LMCS-11(1:20)2015
10.1145/2629496
10.5555/645959.676137
10.1007/978-3-642-14203-1_12
10.1145/1122971.1122992
10.1145/2332432.2332508
10.1017/S0956796818000151
10.1007/978-3-662-53426-7_23
10.1007/s10009-016-0415-4
10.1007/11817963_44
10.1007/978-3-540-73368-3_49
10.1145/3492545
10.1145/3371113
10.1145/1060590.1060697
10.1007/s00446-020-00388-x
10.1007/3-540-54430-5_99
10.1007/978-3-642-40184-8_18
10.1007/11795490_3
10.1007/978-94-017-0435-9_1
10.1007/BF00268134
10.1007/978-3-662-54434-1_24
10.1145/3571231
10.1006/inco.1995.1134
10.1145/114005.102808
10.1145/3293611.3331593
10.1109/ICECCS.2005.49
10.14778/3436905.3436923
10.21236/ADA200584
10.1145/1993636.1993687
10.1145/3410463.3414657
10.1145/2851141.2851161
10.1007/978-3-319-63390-9_28
ContentType Journal Article
Copyright Owner/Author
Copyright_xml – notice: Owner/Author
DBID AAYXX
CITATION
DOI 10.1145/3632924
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 2475-1421
EndPage 2484
ExternalDocumentID 10_1145_3632924
3632924
GrantInformation_xml – fundername: US Department of Defense
  grantid: NDSEG
– fundername: Dartmouth College
  grantid: James Frank Family Professorship
  funderid: https://doi.org/10.13039/100008299
GroupedDBID AAKMM
AAYFX
ACM
AEFXT
AEJOY
AIKLT
AKRVB
ALMA_UNASSIGNED_HOLDINGS
GUFHI
LHSKQ
M~E
OK1
ROL
AAYXX
CITATION
ID FETCH-LOGICAL-a277t-786d0552e5bda7d39c688fe65da9fea3343ee0df876a96e0ab3d8ee3b2e4d5823
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001170729400083&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2475-1421
IngestDate Tue Nov 18 22:13:10 EST 2025
Sat Nov 29 07:45:08 EST 2025
Mon Jul 07 16:40:28 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue POPL
Keywords Linearizability
Universal
Verification
Forward Reasoning
Complete
Language English
License This work is licensed under a Creative Commons Attribution International 4.0 License.
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-a277t-786d0552e5bda7d39c688fe65da9fea3343ee0df876a96e0ab3d8ee3b2e4d5823
ORCID 0000-0002-8930-3467
0000-0002-2681-1632
0000-0002-6218-2466
0009-0000-1823-9990
OpenAccessLink https://dl.acm.org/doi/10.1145/3632924
PageCount 29
ParticipantIDs crossref_citationtrail_10_1145_3632924
crossref_primary_10_1145_3632924
acm_primary_3632924
PublicationCentury 2000
PublicationDate 2024-01-02
PublicationDateYYYYMMDD 2024-01-02
PublicationDate_xml – month: 01
  year: 2024
  text: 2024-01-02
  day: 02
PublicationDecade 2020
PublicationPlace New York, NY, USA
PublicationPlace_xml – name: New York, NY, USA
PublicationTitle Proceedings of ACM on programming languages
PublicationTitleAbbrev ACM PACMPL
PublicationYear 2024
Publisher ACM
Publisher_xml – name: ACM
References (bib23) 2012
(bib31) 2023a
(bib52) 1998
(bib53) 2011
(bib22) 2006
(bib46) 1996
(bib35) 2021; 34
(bib32) 2023b; 2024
(bib33) 2019
(bib11) 2021
(bib43) 2022; 44
(bib5) 2019
(bib13) 2005
(bib26) 1987
(bib12) 2010
(bib16) 2015
(bib45) 1998
(bib20) 2023
(bib36) 2013
(bib30) 2005
(bib40) 2019; 4
(bib56) 2009
(bib8) 2016
(bib37) 1989
(bib41) 2017
(bib49) 2023; 7
(bib10) 2015; 11
(bib27) 1990; 12
(bib24) 2013
(bib19) 2011
(bib15) 2020
(bib17) 2003
(bib3) 2003
(bib21) 2002
(bib18) 2014
(bib57) 2006
(bib7) 2015
(bib50) 1976; 6
(bib44) 1993
(bib14) 2006
(bib1) 1991; 82
(bib25) 1991; 13
(bib48) 2022; 6
(bib54) 2014; 15
(bib28) 2020
(bib38) 1991
(bib47) 1995; 121
(bib6) 2021
(bib51) 2004
(bib55) 2008
(bib4) 2007
(bib9) 2017
(bib2) 2017; 19
(bib29) 2016
(bib42) 1983; 5
(bib39) 2018; 28
(bib34) 2016
Berryhill R. (e_1_3_1_8_1) 2015
e_1_3_1_22_1
e_1_3_1_45_1
e_1_3_1_24_1
Attiya H. (e_1_3_1_7_1) 2021
e_1_3_1_41_1
e_1_3_1_20_1
e_1_3_1_43_1
Schellhorn G. (e_1_3_1_54_1) 2011
e_1_3_1_4_1
e_1_3_1_26_1
e_1_3_1_49_1
e_1_3_1_28_1
e_1_3_1_2_1
Chaudhuri K. (e_1_3_1_13_1) 2010
e_1_3_1_34_1
e_1_3_1_55_1
e_1_3_1_36_1
e_1_3_1_30_1
e_1_3_1_51_1
e_1_3_1_11_1
Jonsson B. (e_1_3_1_38_1) 1989
e_1_3_1_53_1
e_1_3_1_17_1
e_1_3_1_15_1
e_1_3_1_19_1
Vafeiadis V. (e_1_3_1_57_1) 2009
Attiya H. (e_1_3_1_6_1) 2019
e_1_3_1_44_1
e_1_3_1_23_1
e_1_3_1_25_1
e_1_3_1_46_1
e_1_3_1_9_1
e_1_3_1_40_1
e_1_3_1_42_1
e_1_3_1_21_1
e_1_3_1_5_1
e_1_3_1_27_1
e_1_3_1_48_1
e_1_3_1_3_1
e_1_3_1_29_1
Lynch N. A. (e_1_3_1_47_1) 1996
e_1_3_1_10_1
e_1_3_1_33_1
e_1_3_1_35_1
e_1_3_1_58_1
e_1_3_1_14_1
e_1_3_1_52_1
e_1_3_1_12_1
e_1_3_1_31_1
Jayanti P. (e_1_3_1_32_1) 2023
e_1_3_1_18_1
Vafeiadis V. (e_1_3_1_56_1) 2008
e_1_3_1_16_1
e_1_3_1_37_1
Vale A. Oliveira (e_1_3_1_50_1) 2023; 7
e_1_3_1_39_1
References_xml – volume: 2024
  issue: POPL
  year: 2023b
  ident: bib32
  article-title: Artifact for “A Universal, Sound, and Complete Forward Reasoning Technique for Machine-Verified Proofs of Linearizability”
– volume: 12
  start-page: 463
  issue: 3
  year: 1990
  end-page: 492
  ident: bib27
  article-title: Linearizability: A correctness condition for concurrent objects
  publication-title: ACM Trans. Program. Lang. Syst.
– year: 2004
  ident: bib51
  article-title: Software bug contributed to blackout
  publication-title: SecurityFocus
– year: 2016
  ident: bib8
  article-title: Multi-core on-the-fly SCC decomposition
  publication-title: Proceedings of the 21st ACM SIGPLAN symposium on Principles and practice of parallel programming
– start-page: 142
  year: 2010
  end-page: 148
  ident: bib12
  article-title: Verifying safety properties with the TLA+ Proof System
  publication-title: Automated Reasoning
– volume: 28
  start-page: e20
  year: 2018
  ident: bib39
  article-title: Iris from the ground up: A modular foundation for higher-order concurrent separation logic
  publication-title: Journal of Functional Programming
– start-page: 361
  year: 1989
  end-page: 385
  ident: bib37
  article-title: On decomposing and refining specifications of distributed systems
  publication-title: Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop, Mook, The Netherlands, May 29 - June 2, 1989, Proceedings, volume 430 of Lecture Notes in Computer Science
– start-page: 373
  year: 2011
  end-page: 382
  ident: bib19
  article-title: Linearizable implementations do not suffice for randomized distributed computation
  publication-title: Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011
– volume: 13
  start-page: 124
  issue: 1
  year: 1991
  end-page: 149
  ident: bib25
  article-title: Wait-free synchronization
  publication-title: ACM Trans. Program. Lang. Syst.
– year: 2008
  ident: bib55
  article-title: Modular fine-grained concurrency verification
  publication-title: Technical Report UCAM-CL-TR-726
– year: 1993
  ident: bib44
  article-title: An investigation of the Therac-25 accidents
  publication-title: Computer
– year: 2020
  ident: bib28
  article-title: Exploring the design space of static and incremental graph connectivity algorithms on GP Us
  publication-title: Proceedings of the ACM International Conference on Parallel Architectures and Compilation Techniques
– year: 1998
  ident: bib45
  article-title: An engineering disaster: Therac-25
– start-page: 2:1
  year: 2019
  end-page: 2:17
  ident: bib5
  article-title: Putting strong linearizability in context: Preserving hyperproperties in programs that use concurrent objects
  publication-title: 33rd International Symposium on Distributed Computing, DISC 2019, October 14-18, 2019, Budapest, Hungary, volume 146 of LIPIcs
– year: 2014
  ident: bib18
  article-title: Verifying linearizability: A comparative survey
  publication-title: CoRR
– year: 2020
  ident: bib15
  article-title: ConnectIt: A framework for static and incremental parallel graph connectivity algorithms
– start-page: 335
  year: 2009
  end-page: 348
  ident: bib56
  article-title: Shape-value abstraction for verifying linearizability
  publication-title: Verification, Model Checking, and Abstract Interpretation, 10th International Conference, VMCAI 2009, Savannah, GA, USA, January 18-20, 2009. Proceedings, volume 5403 of Lecture Notes in Computer Science
– start-page: 507
  year: 2005
  end-page: 516
  ident: bib13
  article-title: Formal verification of an array-based nonblocking queue
  publication-title: 10th International Conference on Engineering of Complex Computer Systems (ICECCS 2005), 16-20 June 2005, Shanghai, China
– start-page: 477
  year: 2007
  end-page: 490
  ident: bib4
  article-title: Comparison under abstraction for verifying linearizability
  publication-title: Computer Aided Verification, 19th International Conference, CAV 2007, Berlin, Germany, July 3-7, 2007, Proceedings, volume 4590 of Lecture Notes in Computer Science
– start-page: 346
  year: 1991
  end-page: 360
  ident: bib38
  article-title: Simulations between specifications of distributed systems
  publication-title: CONCUR '91, 2nd International Conference on Concurrency Theory, Amsterdam, The Netherlands, August 26-29, 1991, Proceedings, volume 527 of Lecture Notes in Computer Science
– start-page: 475
  year: 2006
  end-page: 488
  ident: bib14
  article-title: Formal verification of a lazy concurrent list-based set algorithm
  publication-title: Computer Aided Verification, 18th International Conference, CAV 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, volume 4144 of Lecture Notes in Computer Science
– start-page: 639
  year: 2017
  end-page: 667
  ident: bib41
  article-title: Proving linearizability using partial orders
  publication-title: Programming Languages and Systems: 26th European Symposium on Programming, ESOP 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017, Proceedings 26
– year: 2021
  ident: bib11
  article-title: An impossibility result on strong linearizability in message-passing systems
  publication-title: CoRR, abs/2108.01651
– start-page: 25:1
  year: 2023a
  end-page: 25:20
  ident: bib31
  article-title: Durable algorithms for writable LL/SC and CAS with dynamic joining
  publication-title: 37th International Symposium on Distributed Computing (DISC 2023), volume 281 of Leibniz International Proceedings in Informatics (LIPIcs)
– start-page: 75
  year: 2016
  end-page: 82
  ident: bib34
  article-title: A randomized concurrent algorithm for disjoint set union
  publication-title: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing
– volume: 6
  issue: POPL
  year: 2022
  ident: bib48
  article-title: Visibility reasoning for concurrent snapshot algorithms
  publication-title: Proc. ACM Program. Lang.
– start-page: 233
  year: 2015
  end-page: 246
  ident: bib16
  article-title: A scalable, correct time-stamped stack
  publication-title: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
– start-page: 187
  year: 2019
  end-page: 196
  ident: bib33
  article-title: Randomized concurrent set union and generalized wake-up
  publication-title: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing
– year: 2003
  ident: bib3
  article-title: Strict linearizability and the power of aborting
– year: 2003
  ident: bib17
  article-title: Modelling and verifying non-blocking algorithms that use dynamically allocated memory
  publication-title: Victoria University of Wellington
– volume: 5
  start-page: 190
  issue: 2
  year: 1983
  end-page: 222
  ident: bib42
  article-title: Specifying concurrent program modules
  publication-title: ACM Trans. Program. Lang. Syst.
– start-page: 13
  year: 1987
  end-page: 26
  ident: bib26
  article-title: Axioms for concurrent objects
  publication-title: Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, Munich, Germany, January 21-23, 1987
– start-page: 13
  year: 1998
  end-page: 39
  ident: bib52
  article-title: Structured specifications and interactive proofs with KIV
  publication-title: Automated Deduction—A Basis for Applications: Volume II: Systems and Implementation Techniques
– volume: 19
  start-page: 549
  issue: 5
  year: 2017
  end-page: 563
  ident: bib2
  article-title: An integrated specification and verification technique for highly concurrent data structures
  publication-title: International Journal on Software Tools for Technology Transfer
– volume: 7
  issue: POPL
  year: 2023
  ident: bib49
  article-title: A compositional theory of linearizability
  publication-title: Proc. ACM Program. Lang.
– year: 2013
  ident: bib36
  article-title: What really happened to the software on the Mars Pathfinder spacecraftŒ
– start-page: 3
  year: 2006
  end-page: 16
  ident: bib22
  article-title: A lazy concurrent list-based set algorithm
  publication-title: Principles of Distributed Systems
– volume: 121
  start-page: 214
  issue: 2
  year: 1995
  end-page: 233
  ident: bib47
  article-title: Forward and backward simulations: I. untimed systems
  publication-title: Inf. Comput.
– start-page: 542
  year: 2017
  end-page: 563
  ident: bib9
  article-title: Proving linearizability using forward simulations
  publication-title: Computer Aided Verification: 29th International Conference, CAV 2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part II 30
– start-page: 723
  year: 2005
  end-page: 732
  ident: bib30
  article-title: An optimal multi-writer snapshot algorithm
  publication-title: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005
– start-page: 99
  year: 2011
  end-page: 106
  ident: bib53
  article-title: Interleaved programs and rely-guarantee reasoning with I TL
  publication-title: Eighteenth International Symposium on Temporal Representation and Reasoning, TIME 2011, Lübeck, Germany, September 12-14, 2011
– start-page: 242
  year: 2013
  end-page: 256
  ident: bib24
  article-title: Aspect-oriented linearizability proofs
  publication-title: CONCUR 2013 – Concurrency Theory
– year: 1996
  ident: bib46
  publication-title: Distributed Algorithms
– volume: 44
  start-page: 6:1
  issue: 2
  year: 2022
  end-page: 6:27
  ident: bib43
  article-title: Prophecy made simple
  publication-title: ACM Trans. Program. Lang. Syst.
– volume: 4
  issue: POPL
  year: 2019
  ident: bib40
  article-title: The future is ours: Prophecy variables in separation logic
  publication-title: Proc. ACM Program. Lang.
– start-page: 7:1
  year: 2021
  end-page: 7:18
  ident: bib6
  article-title: Impossibility of strongly-linearizable message-passing objects via simulation by single-writer registers
  publication-title: 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference) , volume 209 of LIPIcs
– start-page: 385
  year: 2012
  end-page: 394
  ident: bib23
  article-title: Strongly linearizable implementations: Possibilities and impossibilities
  publication-title: Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing
– start-page: 313
  year: 2016
  end-page: 327
  ident: bib29
  article-title: Linearizability of persistent memory objects under a full-system-crash failure model
  publication-title: Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings, volume 9888 of Lecture Notes in Computer Science
– volume: 11
  issue: 1
  year: 2015
  ident: bib10
  article-title: Aspect-oriented linearizability proofs
  publication-title: Logical Methods in Computer Science
– start-page: 265
  year: 2002
  end-page: 279
  ident: bib21
  article-title: A practical multi-word compare-and-swap operation
  publication-title: Proceedings of the 16th International Conference on Distributed Computing
– start-page: 129
  year: 2006
  end-page: 136
  ident: bib57
  article-title: Proving correctness of highly-concurrent linearisable objects
  publication-title: Proceedings of the Eleventh ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
– start-page: 20:1
  year: 2015
  end-page: 20:17
  ident: bib7
  article-title: Robust shared objects for non-volatile main memory
  publication-title: 19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14-17, 2015, Rennes, France, volume 46 of LIPIcs
– volume: 34
  start-page: 413
  issue: 6
  year: 2021
  end-page: 436
  ident: bib35
  article-title: Concurrent disjoint set union
  publication-title: Distributed Comput.
– volume: 82
  start-page: 253
  issue: 2
  year: 1991
  end-page: 284
  ident: bib1
  article-title: The existence of refinement mappings
  publication-title: Theoretical Computer Science
– year: 2023
  ident: bib20
  article-title: Google graph-mining
– volume: 6
  start-page: 319
  year: 1976
  end-page: 340
  ident: bib50
  article-title: An axiomatic proof technique for parallel programs I
  publication-title: Acta Informatica
– volume: 15
  issue: 4
  year: 2014
  ident: bib54
  article-title: A sound and complete proof technique for linearizability of concurrent data structures
  publication-title: ACM Trans. Comput. Logic
– start-page: 2:1
  volume-title: 33rd International Symposium on Distributed Computing, DISC 2019, October 14-18, 2019, Budapest, Hungary, volume 146 of LIPIcs
  year: 2019
  ident: e_1_3_1_6_1
– ident: e_1_3_1_43_1
  doi: 10.1145/69624.357207
– start-page: 20:1
  volume-title: 19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14-17, 2015, Rennes, France, volume 46 of LIPIcs
  year: 2015
  ident: e_1_3_1_8_1
– ident: e_1_3_1_28_1
  doi: 10.1145/78969.78972
– ident: e_1_3_1_17_1
  doi: 10.1145/2676726.2676963
– ident: e_1_3_1_45_1
  doi: 10.1109/MC.1993.274940
– ident: e_1_3_1_49_1
  doi: 10.1145/3498694
– ident: e_1_3_1_33_1
  doi: 10.1145/3632924
– ident: e_1_3_1_35_1
  doi: 10.1145/2933057.2933108
– ident: e_1_3_1_2_1
  doi: 10.1016/0304-3975(91)90224-P
– ident: e_1_3_1_11_1
  doi: 10.2168/LMCS-11(1:20)2015
– start-page: 335
  volume-title: Verification, Model Checking, and Abstract Interpretation, 10th International Conference, VMCAI 2009, Savannah, GA, USA, January 18-20, 2009. Proceedings, volume 5403 of Lecture Notes in Computer Science
  year: 2009
  ident: e_1_3_1_57_1
– ident: e_1_3_1_55_1
  doi: 10.1145/2629496
– ident: e_1_3_1_46_1
– ident: e_1_3_1_22_1
  doi: 10.5555/645959.676137
– start-page: 142
  volume-title: Automated Reasoning
  year: 2010
  ident: e_1_3_1_13_1
  doi: 10.1007/978-3-642-14203-1_12
– ident: e_1_3_1_58_1
  doi: 10.1145/1122971.1122992
– ident: e_1_3_1_4_1
– ident: e_1_3_1_24_1
  doi: 10.1145/2332432.2332508
– ident: e_1_3_1_40_1
  doi: 10.1017/S0956796818000151
– ident: e_1_3_1_30_1
  doi: 10.1007/978-3-662-53426-7_23
– ident: e_1_3_1_3_1
  doi: 10.1007/s10009-016-0415-4
– start-page: 25:1
  volume-title: 37th International Symposium on Distributed Computing (DISC 2023), volume 281 of Leibniz International Proceedings in Informatics (LIPIcs)
  year: 2023
  ident: e_1_3_1_32_1
– ident: e_1_3_1_15_1
  doi: 10.1007/11817963_44
– ident: e_1_3_1_5_1
  doi: 10.1007/978-3-540-73368-3_49
– ident: e_1_3_1_44_1
  doi: 10.1145/3492545
– ident: e_1_3_1_41_1
  doi: 10.1145/3371113
– ident: e_1_3_1_31_1
  doi: 10.1145/1060590.1060697
– ident: e_1_3_1_36_1
  doi: 10.1007/s00446-020-00388-x
– volume-title: Technical Report UCAM-CL-TR-726
  year: 2008
  ident: e_1_3_1_56_1
– ident: e_1_3_1_39_1
  doi: 10.1007/3-540-54430-5_99
– ident: e_1_3_1_19_1
– ident: e_1_3_1_25_1
  doi: 10.1007/978-3-642-40184-8_18
– ident: e_1_3_1_23_1
  doi: 10.1007/11795490_3
– ident: e_1_3_1_53_1
  doi: 10.1007/978-94-017-0435-9_1
– ident: e_1_3_1_52_1
– ident: e_1_3_1_51_1
  doi: 10.1007/BF00268134
– ident: e_1_3_1_21_1
– ident: e_1_3_1_42_1
  doi: 10.1007/978-3-662-54434-1_24
– volume: 7
  year: 2023
  ident: e_1_3_1_50_1
  article-title: A compositional theory of linearizability
  publication-title: Proc. ACM Program. Lang.
  doi: 10.1145/3571231
– ident: e_1_3_1_48_1
  doi: 10.1006/inco.1995.1134
– start-page: 99
  volume-title: Eighteenth International Symposium on Temporal Representation and Reasoning, TIME 2011, Lübeck, Germany, September 12-14, 2011
  year: 2011
  ident: e_1_3_1_54_1
– ident: e_1_3_1_26_1
  doi: 10.1145/114005.102808
– ident: e_1_3_1_34_1
  doi: 10.1145/3293611.3331593
– ident: e_1_3_1_14_1
  doi: 10.1109/ICECCS.2005.49
– ident: e_1_3_1_12_1
– ident: e_1_3_1_16_1
  doi: 10.14778/3436905.3436923
– start-page: 7:1
  volume-title: 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference) , volume 209 of LIPIcs
  year: 2021
  ident: e_1_3_1_7_1
– ident: e_1_3_1_37_1
– start-page: 361
  volume-title: Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop, Mook, The Netherlands, May 29 - June 2, 1989, Proceedings, volume 430 of Lecture Notes in Computer Science
  year: 1989
  ident: e_1_3_1_38_1
– volume-title: Distributed Algorithms
  year: 1996
  ident: e_1_3_1_47_1
– ident: e_1_3_1_27_1
  doi: 10.21236/ADA200584
– ident: e_1_3_1_20_1
  doi: 10.1145/1993636.1993687
– ident: e_1_3_1_29_1
  doi: 10.1145/3410463.3414657
– ident: e_1_3_1_9_1
  doi: 10.1145/2851141.2851161
– ident: e_1_3_1_10_1
  doi: 10.1007/978-3-319-63390-9_28
– ident: e_1_3_1_18_1
SSID ssj0001934839
Score 2.2892962
Snippet We introduce simple, universal, sound, and complete proof methods for producing machine-verifiable proofs of linearizability and strong linearizability....
We introduce simple, universal , sound , and complete proof methods for producing machine-verifiable proofs of linearizability and strong linearizability....
SourceID crossref
acm
SourceType Enrichment Source
Index Database
Publisher
StartPage 2456
SubjectTerms Concurrent algorithms
Formal methods and theory of security
Logic and verification
Program verification
Security and privacy
Theory of computation
SubjectTermsDisplay Security and privacy -- Formal methods and theory of security
Security and privacy -- Logic and verification
Theory of computation -- Concurrent algorithms
Theory of computation -- Program verification
Title A Universal, Sound, and Complete Forward Reasoning Technique for Machine-Verified Proofs of Linearizability
URI https://dl.acm.org/doi/10.1145/3632924
Volume 8
WOSCitedRecordID wos001170729400083&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2475-1421
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001934839
  issn: 2475-1421
  databaseCode: M~E
  dateStart: 20170101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLfK4MCFwQBRBsgHxKXLKP6InWM1MXFoR6R10naqHNthEVs6pR8aO_DP8Y_xHCdpFlUCDlysyLXd1u8Xv5eX33sPofcRCcGKtmkAyl4HLEnCQEZWBpqlQlloqE_iOhYnJ_L8PIp7vV91LMz6SuS5vL2Nbv6rqKEPhO1CZ_9B3M2i0AHXIHRoQezQ_pXgRzXZokzlPzh1dZNqjqa7-0FQdnA8Lxxd1nHoF94hO22SuTri4aTkWFrn7stSZ6XGYGGnJe0Dnl5hyxwZzNFq770VjhttWI4cHU3cu4iKAnbtvqV2j26Ii-oHyLakFMSFWiiz5YPTzJhL-KeXjQq5UOtV6fk--7YqBheHG49uyys-zu7uMtt2axBWujVank7CBA8-MR8-fWi39FXHt2yhNP4aj9unMeNhS7MTnzZ1i9ZgLsEGDSmJfED3_bzcHX3ZsBh9TDefVRMfoIdE8MjxCic_W46-iDJZVrRrfr4P3nZzP1ZznW2kr1u2UcvImT5FT6qnEzzyqHqGejbfQ7t15Q9cKYLn6PsINyA7wCXEDjBsPK4BhiuA4QZguAEYBoDhLsCwBxiep7gDsBfo7Pjz9OhLUJXtCBQRYhkIGZoh58TyxChhaKRDKVMbcqOi1CpKGbV2aFLQwwqOiaFKqJHW0oRYZrgk9CXayee5fYUw11pHhoOVNTRMD5OEa1jXWCoFlUSLPtqDbZvd-MQstSD66EO9jTNdZbp3BVeuZh2J9RFuBtZrdIa8_vOQffR4A-A3aGdZrOxb9Eivl9mieFeC4Teow5iX
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Universal%2C+Sound%2C+and+Complete+Forward+Reasoning+Technique+for+Machine-Verified+Proofs+of+Linearizability&rft.jtitle=Proceedings+of+ACM+on+programming+languages&rft.au=Jayanti%2C+Prasad&rft.au=Jayanti%2C+Siddhartha&rft.au=Yavuz%2C+Ugur+Y.&rft.au=Hernandez%2C+Lizzie&rft.date=2024-01-02&rft.issn=2475-1421&rft.eissn=2475-1421&rft.volume=8&rft.issue=POPL&rft.spage=2456&rft.epage=2484&rft_id=info:doi/10.1145%2F3632924&rft.externalDBID=n%2Fa&rft.externalDocID=10_1145_3632924
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2475-1421&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2475-1421&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2475-1421&client=summon