{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T03:23:11Z","timestamp":1790738591499,"version":"4.1.0"},"reference-count":85,"publisher":"Association for Computing Machinery (ACM)","issue":"POPL","license":[{"start":{"date-parts":[[2019,1,2]],"date-time":"2019-01-02T00:00:00Z","timestamp":1546387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2019,1,2]]},"abstract":"<jats:p>Verification of concurrent data structures is one of the most challenging tasks in software verification. The topic has received considerable attention over the course of the last decade. Nevertheless, human-driven techniques remain cumbersome and notoriously difficult while automated approaches suffer from limited applicability. The main obstacle for automation is the complexity of concurrent data structures. This is particularly true in the absence of garbage collection. The intricacy of lock-free memory management paired with the complexity of concurrent data structures makes automated verification prohibitive.<\/jats:p>\n          <jats:p>In this work we present a method for verifying concurrent data structures and their memory management separately. We suggest two simpler verification tasks that imply the correctness of the data structure. The first task establishes an over-approximation of the reclamation behavior of the memory management. The second task exploits this over-approximation to verify the data structure without the need to consider the implementation of the memory management itself. To make the resulting verification tasks tractable for automated techniques, we establish a second result. We show that a verification tool needs to consider only executions where a single memory location is reused. We implemented our approach and were able to verify linearizability of Michael&amp;Scott's queue and the DGLM queue for both hazard pointers and epoch-based reclamation. To the best of our knowledge, we are the first to verify such implementations fully automatically.<\/jats:p>","DOI":"10.1145\/3290371","type":"journal-article","created":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T13:33:51Z","timestamp":1546608831000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Decoupling lock-free data structures from memory reclamation for static analysis"],"prefix":"10.1145","volume":"3","author":[{"given":"Roland","family":"Meyer","sequence":"first","affiliation":[{"name":"TU Braunschweig, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastian","family":"Wolff","sequence":"additional","affiliation":[{"name":"TU Braunschweig, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,1,2]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"TACAS (LNCS)","author":"Abdulla Parosh Aziz","unstructured":"Parosh Aziz Abdulla , Fr\u00e9d\u00e9ric Haziza , Luk\u00e1s Hol\u00edk , Bengt Jonsson , and Ahmed Rezine . 2013. An Integrated Specification and Verification Technique for Highly Concurrent Data Structures . In TACAS (LNCS) , Vol. 7795 . Springer , 324\u2013338. Parosh Aziz Abdulla, Fr\u00e9d\u00e9ric Haziza, Luk\u00e1s Hol\u00edk, Bengt Jonsson, and Ahmed Rezine. 2013. An Integrated Specification and Verification Technique for Highly Concurrent Data Structures. In TACAS (LNCS), Vol. 7795. Springer, 324\u2013338."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-016-0415-4"},{"key":"e_1_2_2_3_1","volume-title":"SAS (LNCS)","author":"Abdulla Parosh Aziz","unstructured":"Parosh Aziz Abdulla , Bengt Jonsson , and Cong Quy Trinh . 2016. Automated Verification of Linearization Policies . In SAS (LNCS) , Vol. 9837 . Springer , 61\u201383. Parosh Aziz Abdulla, Bengt Jonsson, and Cong Quy Trinh. 2016. Automated Verification of Linearization Policies. In SAS (LNCS), Vol. 9837. Springer, 61\u201383."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611483"},{"key":"e_1_2_2_5_1","volume-title":"CAV (LNCS)","author":"Alglave Jade","unstructured":"Jade Alglave , Daniel Kroening , and Michael Tautschnig . 2013. Partial Orders for Efficient Bounded Model Checking of Concurrent Software . In CAV (LNCS) , Vol. 8044 . Springer , 141\u2013157. Jade Alglave, Daniel Kroening, and Michael Tautschnig. 2013. Partial Orders for Efficient Bounded Model Checking of Concurrent Software. In CAV (LNCS), Vol. 8044. Springer, 141\u2013157."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592808"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755600"},{"key":"e_1_2_2_8_1","volume-title":"CAV (LNCS)","author":"Amit Daphna","unstructured":"Daphna Amit , Noam Rinetzky , Thomas W. Reps , Mooly Sagiv , and Eran Yahav . 2007. Comparison Under Abstraction for Verifying Linearizability . In CAV (LNCS) , Vol. 4590 . Springer , 477\u2013490. Daphna Amit, Noam Rinetzky, Thomas W. Reps, Mooly Sagiv, and Eran Yahav. 2007. Comparison Under Abstraction for Verifying Linearizability. In CAV (LNCS), Vol. 4590. Springer, 477\u2013490."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935790"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-009-0130-y"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_37"},{"key":"e_1_2_2_12_1","volume-title":"CAV (2) (LNCS)","author":"Bouajjani Ahmed","unstructured":"Ahmed Bouajjani , Michael Emmi , Constantin Enea , and Suha Orhun Mutluergil . 2017. Proving Linearizability Using Forward Simulations . In CAV (2) (LNCS) , Vol. 10427 . Springer , 542\u2013563. Ahmed Bouajjani, Michael Emmi, Constantin Enea, and Suha Orhun Mutluergil. 2017. Proving Linearizability Using Forward Simulations. In CAV (2) (LNCS), Vol. 10427. Springer, 542\u2013563."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486184"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767436"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806634"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_41"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2814270.2814298"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755579"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.04.026"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_44"},{"key":"e_1_2_2_21_1","volume-title":"ECOOP (LIPIcs)","volume":"74","author":"Delbianco Germ\u00e1n Andr\u00e9s","year":"2017","unstructured":"Germ\u00e1n Andr\u00e9s Delbianco , Ilya Sergey , Aleksandar Nanevski , and Anindya Banerjee . 2017 . Concurrent Data Structures Linked in Time . In ECOOP (LIPIcs) , Vol. 74 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 8:1\u20138:30. Germ\u00e1n Andr\u00e9s Delbianco, Ilya Sergey, Aleksandar Nanevski, and Anindya Banerjee. 2017. Concurrent Data Structures Linked in Time. In ECOOP (LIPIcs), Vol. 74. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 8:1\u20138:30."},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1889997.1890001"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2506164.2506174"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384016"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2926697.2926699"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676963"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007945"},{"key":"e_1_2_2_28_1","volume-title":"FORTE (LNCS)","author":"Doherty Simon","unstructured":"Simon Doherty , Lindsay Groves , Victor Luchangco , and Mark Moir . 2004b. Formal Verification of a Practical Lock-Free Queue Algorithm . In FORTE (LNCS) , Vol. 3235 . Springer , 97\u2013114. Simon Doherty, Lindsay Groves, Victor Luchangco, and Mark Moir. 2004b. Formal Verification of a Practical Lock-Free Queue Algorithm. In FORTE (LNCS), Vol. 3235. Springer, 97\u2013114."},{"key":"e_1_2_2_29_1","volume-title":"DISC (LNCS)","author":"Doherty Simon","unstructured":"Simon Doherty and Mark Moir . 2009. Nonblocking Algorithms and Backward Simulation . In DISC (LNCS) , Vol. 5805 . Springer , 274\u2013288. Simon Doherty and Mark Moir. 2009. Nonblocking Algorithms and Backward Simulation. In DISC (LNCS), Vol. 5805. Springer, 274\u2013288."},{"key":"e_1_2_2_30_1","volume-title":"Verifying linearizability: A comparative survey. CoRR abs\/1410.6268","author":"Dongol Brijesh","year":"2014","unstructured":"Brijesh Dongol and John Derrick . 2014. Verifying linearizability: A comparative survey. CoRR abs\/1410.6268 ( 2014 ). http:\/\/arxiv.org\/abs\/1410.6268 Brijesh Dongol and John Derrick. 2014. Verifying linearizability: A comparative survey. CoRR abs\/1410.6268 (2014). http:\/\/arxiv.org\/abs\/1410.6268"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993821"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12002-2_25"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158113"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2737983"},{"key":"e_1_2_2_36_1","volume-title":"CONCUR (LNCS)","author":"Fu Ming","unstructured":"Ming Fu , Yong Li , Xinyu Feng , Zhong Shao , and Yu Zhang . 2010. Reasoning about Optimistic Concurrency Using a Program Logic for History . In CONCUR (LNCS) , Vol. 6269 . Springer , 388\u2013402. Ming Fu, Yong Li, Xinyu Feng, Zhong Shao, and Yu Zhang. 2010. Reasoning about Optimistic Concurrency Using a Program Logic for History. In CONCUR (LNCS), Vol. 6269. Springer, 388\u2013402."},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPAN.2005.42"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37036-6_15"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICECCS.2007.39"},{"key":"e_1_2_2_40_1","volume-title":"CATS (CRPIT)","volume":"77","author":"Groves Lindsay","year":"2008","unstructured":"Lindsay Groves . 2008 . Verifying Michael and Scott\u2019s Lock-Free Queue Algorithm using Trace Reduction . In CATS (CRPIT) , Vol. 77 . Australian Computer Society, 133\u2013142. http:\/\/crpit.com\/abstracts\/CRPITV77Groves.html Lindsay Groves. 2008. Verifying Michael and Scott\u2019s Lock-Free Queue Algorithm using Trace Reduction. In CATS (CRPIT), Vol. 77. Australian Computer Society, 133\u2013142. http:\/\/crpit.com\/abstracts\/CRPITV77Groves.html"},{"key":"e_1_2_2_41_1","volume-title":"DISC (LNCS)","author":"Harris Timothy L.","unstructured":"Timothy L. Harris . 2001. A Pragmatic Implementation of Non-blocking Linked-Lists . In DISC (LNCS) , Vol. 2180 . Springer , 300\u2013314. Timothy L. Harris. 2001. A Pragmatic Implementation of Non-blocking Linked-Lists. In DISC (LNCS), Vol. 2180. Springer, 300\u2013314."},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49122-5_19"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48653-5_25"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40184-8_18"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062247.1062249"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_2_2_47_1","volume-title":"SAS (LNCS)","author":"Hol\u00edk Luk\u00e1s","unstructured":"Luk\u00e1s Hol\u00edk , Roland Meyer , Tom\u00e1s Vojnar , and Sebastian Wolff . 2017. Effect Summaries for Thread-Modular Analysis -Sound Analysis Despite an Unsound Heuristic . In SAS (LNCS) , Vol. 10422 . Springer , 169\u2013191. Luk\u00e1s Hol\u00edk, Roland Meyer, Tom\u00e1s Vojnar, and Sebastian Wolff. 2017. Effect Summaries for Thread-Modular Analysis -Sound Analysis Despite an Unsound Heuristic. In SAS (LNCS), Vol. 10422. Springer, 169\u2013191."},{"key":"e_1_2_2_48_1","volume-title":"FORTE (LNCS)","author":"Horn Alex","unstructured":"Alex Horn and Daniel Kroening . 2015. Faster Linearizability Checking via P-Compositionality . In FORTE (LNCS) , Vol. 9039 . Springer , 50\u201365. Alex Horn and Daniel Kroening. 2015. Faster Linearizability Checking via P-Compositionality. In FORTE (LNCS), Vol. 9039. Springer, 50\u201365."},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/69575.69577"},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-012-0250-7"},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54434-1_24"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3092282.3092287"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158125"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462189"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103711"},{"key":"e_1_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576235"},{"key":"e_1_2_2_57_1","volume-title":"Verification of tree-based hierarchical read-copy update in the Linux kernel","author":"Liang Lihao","unstructured":"Lihao Liang , Paul E. McKenney , Daniel Kroening , and Tom Melham . 2018. Verification of tree-based hierarchical read-copy update in the Linux kernel . In DATE. IEEE , 61\u201366. Lihao Liang, Paul E. McKenney, Daniel Kroening, and Tom Melham. 2018. Verification of tree-based hierarchical read-copy update in the Linux kernel. In DATE. IEEE, 61\u201366."},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05089-3_21"},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2012.82"},{"key":"e_1_2_2_60_1","volume-title":"Testing for linearizability. Concurrency and Computation: Practice and Experience 29, 4","author":"Lowe Gavin","year":"2017","unstructured":"Gavin Lowe . 2017. Testing for linearizability. Concurrency and Computation: Practice and Experience 29, 4 ( 2017 ). Gavin Lowe. 2017. Testing for linearizability. Concurrency and Computation: Practice and Experience 29, 4 (2017)."},{"key":"e_1_2_2_62_1","volume-title":"Slingwine","author":"McKenney Paul E.","year":"1998","unstructured":"Paul E. McKenney and John D . Slingwine . 1998 . Read-copy Update : Using Execution History to Solve Concurrency Problems . Paul E. McKenney and John D. Slingwine. 1998. Read-copy Update: Using Execution History to Solve Concurrency Problems."},{"key":"e_1_2_2_63_1","volume-title":"Decoupling Lock-Free Data Structures from Memory Reclamation for Static Analysis. CoRR abs\/1810.10807","author":"Meyer Roland","year":"2018","unstructured":"Roland Meyer and Sebastian Wolff . 2018. Decoupling Lock-Free Data Structures from Memory Reclamation for Static Analysis. CoRR abs\/1810.10807 ( 2018 ). http:\/\/arxiv.org\/abs\/1810.10807 Roland Meyer and Sebastian Wolff. 2018. Decoupling Lock-Free Data Structures from Memory Reclamation for Static Analysis. CoRR abs\/1810.10807 (2018). http:\/\/arxiv.org\/abs\/1810.10807"},{"key":"e_1_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571829"},{"key":"e_1_2_2_65_1","volume-title":"Scott","author":"Michael Maged M.","year":"1995","unstructured":"Maged M. Michael and Michael L . Scott . 1995 . Correction of a Memory Management Method for Lock-Free Data Structures. Technical Report. Rochester, NY, USA. Maged M. Michael and Michael L. Scott. 1995. Correction of a Memory Management Method for Lock-Free Data Structures. Technical Report. Rochester, NY, USA."},{"key":"e_1_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248106"},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835722"},{"key":"e_1_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190261"},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087588"},{"key":"e_1_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_21"},{"key":"e_1_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10672-9_5"},{"key":"e_1_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2737964"},{"key":"e_1_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46669-8_14"},{"key":"e_1_2_2_74_1","volume-title":"SPIN (LNCS)","author":"Sethi Divjyot","unstructured":"Divjyot Sethi , Muralidhar Talupur , and Sharad Malik . 2013. Model Checking Unbounded Concurrent Lists . In SPIN (LNCS) , Vol. 7976 . Springer , 320\u2013340. Divjyot Sethi, Muralidhar Talupur, and Sharad Malik. 2013. Model Checking Unbounded Concurrent Lists. In SPIN (LNCS), Vol. 7976. Springer, 320\u2013340."},{"key":"e_1_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2737992"},{"key":"e_1_2_2_76_1","volume-title":"ICTAC (LNCS)","author":"Tofan Bogdan","unstructured":"Bogdan Tofan , Gerhard Schellhorn , and Wolfgang Reif . 2011. Formal Verification of a Lock-Free Stack with Hazard Pointers . In ICTAC (LNCS) , Vol. 6916 . Springer , 239\u2013255. Bogdan Tofan, Gerhard Schellhorn, and Wolfgang Reif. 2011. Formal Verification of a Lock-Free Stack with Hazard Pointers. In ICTAC (LNCS), Vol. 6916. Springer, 239\u2013255."},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03077-7_21"},{"key":"e_1_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_40"},{"key":"e_1_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11319-2_25"},{"key":"e_1_2_2_81_1","volume-title":"Verification of Concurrent Programs: The Automata-Theoretic Framework","author":"Vardi Moshe Y.","unstructured":"Moshe Y. Vardi . 1987. Verification of Concurrent Programs: The Automata-Theoretic Framework . In LICS. IEEE Computer Society , 167\u2013176. Moshe Y. Vardi. 1987. Verification of Concurrent Programs: The Automata-Theoretic Framework. In LICS. IEEE Computer Society, 167\u2013176."},{"key":"e_1_2_2_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375598"},{"key":"e_1_2_2_83_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02652-2_21"},{"key":"e_1_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178488"},{"key":"e_1_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/3092255.3092274"},{"key":"e_1_2_2_86_1","volume-title":"Verifying Concurrent Stacks by Divergence-Sensitive Bisimulation. CoRR abs\/1701.06104","author":"Yang Xiaoxiao","year":"2017","unstructured":"Xiaoxiao Yang , Joost-Pieter Katoen , Huimin Lin , and Hao Wu. 2017. Verifying Concurrent Stacks by Divergence-Sensitive Bisimulation. CoRR abs\/1701.06104 ( 2017 ). http:\/\/arxiv.org\/abs\/1701.06104 Xiaoxiao Yang, Joost-Pieter Katoen, Huimin Lin, and Hao Wu. 2017. Verifying Concurrent Stacks by Divergence-Sensitive Bisimulation. CoRR abs\/1701.06104 (2017). http:\/\/arxiv.org\/abs\/1701.06104"},{"key":"e_1_2_2_87_1","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1986037"},{"key":"e_1_2_2_88_1","volume-title":"Poling: SMT Aided Linearizability Proofs. In CAV (2) (LNCS)","author":"Zhu He","year":"2015","unstructured":"He Zhu , Gustavo Petri , and Suresh Jagannathan . 2015 . Poling: SMT Aided Linearizability Proofs. In CAV (2) (LNCS) , Vol. 9207 . Springer , 3\u201319. He Zhu, Gustavo Petri, and Suresh Jagannathan. 2015. Poling: SMT Aided Linearizability Proofs. In CAV (2) (LNCS), Vol. 9207. Springer, 3\u201319."}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3290371","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3290371","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:58:04Z","timestamp":1750208284000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3290371"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,2]]},"references-count":85,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2019,1,2]]}},"alternative-id":["10.1145\/3290371"],"URL":"https:\/\/doi.org\/10.1145\/3290371","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,2]]},"assertion":[{"value":"2019-01-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}