{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:15:24Z","timestamp":1775873724301,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,2,22]],"date-time":"2020-02-22T00:00:00Z","timestamp":1582329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,2,22]]},"DOI":"10.1145\/3368826.3377910","type":"proceedings-article","created":{"date-parts":[[2020,2,21]],"date-time":"2020-02-21T21:49:28Z","timestamp":1582321768000},"page":"68-80","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Interactive debugging of concurrent programs under relaxed memory models"],"prefix":"10.1145","author":[{"given":"Aakanksha","family":"Verma","sequence":"first","affiliation":[{"name":"IIT Kanpur, India"}]},{"given":"Pankaj Kumar","family":"Kalita","sequence":"additional","affiliation":[{"name":"IIT Kanpur, India"}]},{"given":"Awanish","family":"Pandey","sequence":"additional","affiliation":[{"name":"IIT Kanpur, India"}]},{"given":"Subhajit","family":"Roy","sequence":"additional","affiliation":[{"name":"IIT Kanpur, India"}]}],"member":"320","published-online":{"date-parts":[[2020,2,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-016-0275-0"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36742-7_37"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276505"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2994593"},{"key":"e_1_3_2_1_5_1","volume-title":"Computer Aided Verification","author":"Alglave Jade","unstructured":"Jade Alglave and Luc Maranget. 2011. Stability in Weak Memory Models. In Computer Aided Verification. Springer Berlin Heidelberg, Berlin, Heidelberg, 50\u201366."},{"key":"e_1_3_2_1_6_1","volume-title":"Fences in Weak Memory Models","author":"Alglave Jade","unstructured":"Jade Alglave, Luc Maranget, Susmit Sarkar, and Peter Sewell. 2010. Fences in Weak Memory Models. In Computer Aided Verification, Tayssir Touili, Byron Cook, and Paul Jackson (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 258\u2013272."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837637"},{"key":"e_1_3_2_1_8_1","volume-title":"Checking and Enforcing Robustness against TSO","author":"Bouani Ahmed","unstructured":"Ahmed Bouani, Egor Derevenetc, and Roland Meyer. 2013. Checking and Enforcing Robustness against TSO. In Programming Languages and Systems, Matthias Felleisen and Philippa Gardner (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 533\u2013553."},{"key":"e_1_3_2_1_9_1","volume-title":"Deciding Robustness against Total Store Ordering","author":"Bouani Ahmed","unstructured":"Ahmed Bouani, Roland Meyer, and Eike M\u00f6hlmann. 2011. Deciding Robustness against Total Store Ordering. In Automata, Languages and Programming, Luca Aceto, Monika Henzinger, and Ji\u0159\u00ed Sgall (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 428\u2013440."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250737"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1735971.1736040"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2008.69"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001420.2001436"},{"key":"e_1_3_2_1_14_1","volume-title":"Computer Aided Verification","author":"Clarke Edmund","unstructured":"Edmund Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith. 2000. Counterexample-Guided Abstraction Refinement. In Computer Aided Verification. Springer Berlin Heidelberg, Berlin, Heidelberg, 154\u2013169."},{"key":"e_1_3_2_1_15_1","volume-title":"Computer Aided Verification","author":"Clarke Edmund","unstructured":"Edmund Clarke, Anubhav Gupta, James Kukula, and Ofer Strichman. 2002. SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques. In Computer Aided Verification. Springer Berlin Heidelberg, Berlin, Heidelberg, 265\u2013279."},{"key":"e_1_3_2_1_16_1","unstructured":"Classic and Fast benchmarks from the Musketeer. (last accessed 15 Feb 2019). http:\/\/www.cprover.org\/wmm\/fence13\/benchmarks.tar.gz"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2814270.2814297"},{"key":"e_1_3_2_1_19_1","volume-title":"Logical Concurrency Control from Sequential Proofs","author":"Deshmukh Jyotirmoy","unstructured":"Jyotirmoy Deshmukh, G. Ramalingam, Venkatesh-Prasad Ranganath, and Kapil Vaswani. 2010. Logical Concurrency Control from Sequential Proofs. In Programming Languages and Systems, Andrew D. Gordon (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 226\u2013245."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964023"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065036"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040316"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s100090050043"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2737975"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2984025"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-007-0041-6"},{"key":"e_1_3_2_1_27_1","volume-title":"Property-Driven Fence Insertion Using Reorder Bounded Model Checking. In FM 2015: Formal Methods, Nikolaj Bj\u00f8rner and Frank de Boer (Eds.). Springer International Publishing, Cham, 291\u2013307","author":"Joshi Saurabh","year":"2015","unstructured":"Saurabh Joshi and Daniel Kroening. 2015. Property-Driven Fence Insertion Using Reorder Bounded Model Checking. In FM 2015: Formal Methods, Nikolaj Bj\u00f8rner and Frank de Boer (Eds.). Springer International Publishing, Cham, 291\u2013307."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2009.82"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158105"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314609"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2261417.2261438"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3106237.3106243"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837643"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062352"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/2032692.2032707"},{"key":"e_1_3_2_1_36_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems, Nir Piterman and Scott A","author":"Linden Alexander","unstructured":"Alexander Linden and Pierre Wolper. 2013. A Verification-Based Approach to Memory Fence Insertion in PSO Memory Systems. In Tools and Algorithms for the Construction and Analysis of Systems, Nir Piterman and Scott A. Smolka (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 339\u2013353."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/361227.361234"},{"key":"e_1_3_2_1_38_1","volume-title":"Martin","author":"Mador-Haim Sela","year":"2010","unstructured":"Sela Mador-Haim, Rajeev Alur, and Milo M. K. Martin. 2010. Generating Litmus Tests for Contrasting Memory Consistency Models. In Computer Aided Verification, Tayssir Touili, Byron Cook, and Paul Jackson (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 273\u2013287."},{"key":"e_1_3_2_1_39_1","volume-title":"An Axiomatic Memory Model for POWER Multiprocessors","author":"Mador-Haim Sela","unstructured":"Sela Mador-Haim, Luc Maranget, Susmit Sarkar, Kayvan Memarian, Jade Alglave, Scott Owens, Rajeev Alur, Milo M. K. Martin, Peter Sewell, and Derek Williams. 2012. An Axiomatic Memory Model for POWER Multiprocessors. In Computer Aided Verification, P. Madhusudan and Sanjit A. Seshia (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 495\u2013512."},{"key":"e_1_3_2_1_40_1","volume-title":"Workshop on Formal Techniques for Java-like Programs, in association with ECOOP.","author":"Manson Jeremy","year":"2002","unstructured":"Jeremy Manson and William Pugh. 2002. The Java memory model simulator. In Workshop on Formal Techniques for Java-like Programs, in association with ECOOP."},{"key":"e_1_3_2_1_41_1","unstructured":"Paul E. Mckenney. 2009. Memory Barriers: a Hardware View for Software Hackers."},{"key":"e_1_3_2_1_42_1","volume-title":"Piramanayakam Arumuga Nainar, and Iulian Neamtiu","author":"Musuvathi Madan","year":"2008","unstructured":"Madan Musuvathi, Shaz Qadeer, Tom Ball, Gerard Basler, Piramanayakam Arumuga Nainar, and Iulian Neamtiu. 2008. Finding and Reproducing Heisenbugs in Concurrent Programs. In OSDI 08: Eigth Symposium on Operating Systems Design and Implementation (osdi 08: eigth symposium on operating systems design and implementation ed.). USENIX. https:\/\/www.microsoft.com\/en-us\/research\/publication\/ finding-and-reproducing-heisenbugs-in-concurrent-programs\/"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2983997"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2509136.2509514"},{"key":"e_1_3_2_1_45_1","volume-title":"Engineering Record and Replay for Deployability. In 2017 USENIX Annual Technical Conference (USENIX ATC 17)","author":"O\u2019Callahan Robert","year":"2017","unstructured":"Robert O\u2019Callahan, Chris Jones, Nathan Froyd, Kyle Huey, Albert Noll, and Nimrod Partush. 2017. Engineering Record and Replay for Deployability. In 2017 USENIX Annual Technical Conference (USENIX ATC 17). USENIX Association, Santa Clara, CA, 377\u2013389. https:\/\/www.usenix. org\/conference\/atc17\/technical-sessions\/presentation\/ocallahan"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018743.3018749"},{"key":"e_1_3_2_1_47_1","volume-title":"Theorem Proving in Higher Order Logics","author":"Owens Scott","unstructured":"Scott Owens, Susmit Sarkar, and Peter Sewell. 2009. A Better x86 Memory Model: x86-TSO. In Theorem Proving in Higher Order Logics, Stefan Berghofer, Tobias Nipkow, Christian Urban, and Makarius Wenzel (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 391\u2013407."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/360051.360224"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/781498.781529"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/265924.265927"},{"key":"e_1_3_2_1_51_1","volume-title":"Moving Around: Lipton\u2019s Reduction for TSO. In Verified Software: Theories, Tools, and Experiments, Arie Gurfinkel and Sanjit A","author":"Sezgin Ali","year":"2016","unstructured":"Ali Sezgin and Serdar Tasiran. 2016. Moving Around: Lipton\u2019s Reduction for TSO. In Verified Software: Theories, Tools, and Experiments, Arie Gurfinkel and Sanjit A. Seshia (Eds.). Springer International Publishing, Cham, 165\u2013182."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/42190.42277"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111067"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706338"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3106237.3106263"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009838"},{"key":"e_1_3_2_1_58_1","volume-title":"Scheduling Constraint Based Abstraction Refinement for Multi-Threaded Program Verification. CoRR abs\/1708.08323","author":"Yin Liangze","year":"2017","unstructured":"Liangze Yin, Wei Dong, Wanwei Liu, and Ji Wang. 2017. Scheduling Constraint Based Abstraction Refinement for Multi-Threaded Program Verification. CoRR abs\/1708.08323 (2017). arXiv: 1708.08323 http: \/\/arxiv.org\/abs\/1708.08323"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3238147.3238223"}],"event":{"name":"CGO '20: 18th ACM\/IEEE International Symposium on Code Generation and Optimization","location":"San Diego CA USA","acronym":"CGO '20","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing","IEEE-CS Computer Society"]},"container-title":["Proceedings of the 18th ACM\/IEEE International Symposium on Code Generation and Optimization"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3368826.3377910","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3368826.3377910","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:28Z","timestamp":1750202608000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3368826.3377910"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,22]]},"references-count":58,"alternative-id":["10.1145\/3368826.3377910","10.1145\/3368826"],"URL":"https:\/\/doi.org\/10.1145\/3368826.3377910","relation":{},"subject":[],"published":{"date-parts":[[2020,2,22]]},"assertion":[{"value":"2020-02-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}