{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:05:45Z","timestamp":1767927945632,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":70,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T00:00:00Z","timestamp":1743292800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Cyber Security Agency of Singapore","award":["NRF-NCR25-Fuzz-0001"],"award-info":[{"award-number":["NRF-NCR25-Fuzz-0001"]}]},{"name":"National Research Foundation Singapore","award":["NRF-NCR25-Fuzz-0001"],"award-info":[{"award-number":["NRF-NCR25-Fuzz-0001"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,3,30]]},"DOI":"10.1145\/3669940.3707214","type":"proceedings-article","created":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T12:28:01Z","timestamp":1738844881000},"page":"1003-1019","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Selectively Uniform Concurrency Testing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-6412-0666","authenticated-orcid":false,"given":"Huan","family":"Zhao","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6958-7159","authenticated-orcid":false,"given":"Dylan","family":"Wolff","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7610-0660","authenticated-orcid":false,"given":"Umang","family":"Mathur","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7127-1137","authenticated-orcid":false,"given":"Abhik","family":"Roychoudhury","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2025,3,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3360576"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81685-8_16"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3632915"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89963-3_14"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454115.1454128"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1735970.1736040"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338906.3338927"},{"key":"e_1_3_2_1_8_1","volume-title":"Computer Aided Verification: 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17--23, 2016, Proceedings, Part II 28","author":"Chistikov Dmitry","year":"2016","unstructured":"Dmitry Chistikov, Rupak Majumdar, and Filip Niksic. 2016. Hitting families of schedules for asynchronous programs. In Computer Aided Verification: 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17--23, 2016, Proceedings, Part II 28. Springer, 157--176."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24730-2_15"},{"key":"e_1_3_2_1_10_1","unstructured":"ConVul CVE dataset. 2019. https:\/\/github.com\/mryancai\/ConVul. Accessed 20-04--2024."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985839"},{"key":"e_1_3_2_1_12_1","unstructured":"Microsoft Coyote. [n. d.]. GitHub - microsoft\/coyote: Coyote is a library and tool for testing concurrent Csharp code and deterministically reproducing bugs. https:\/\/github.com\/microsoft\/coyote. Accessed 20-04--2024."},{"key":"e_1_3_2_1_13_1","unstructured":"CVE-2016--1972. 2016. Available from MITRE CVE-ID CVE-2016--1972. https:\/\/cve.mitre.org\/cgi-bin\/cvename.cgi?name=CVE-2016--1972"},{"key":"e_1_3_2_1_14_1","unstructured":"CVE-2016--5195. 2016. Available from NIST CVE-ID CVE-2016--5195. https:\/\/nvd.nist.gov\/vuln\/detail\/cve-2016--5195"},{"key":"e_1_3_2_1_15_1","first-page":"2","article-title":"Exploiting the lattice of ideals representation of a poset","volume":"71","author":"Loof Karel De","year":"2006","unstructured":"Karel De Loof, Hans De Meyer, and Bernard De Baets. 2006. Exploiting the lattice of ideals representation of a poset. Fundamenta Informaticae, Vol. 71, 2--3 (2006), 309--321.","journal-title":"Fundamenta Informaticae"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3385972"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<260::AID-RSA5>3.0.CO;2-W"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926432"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3632873"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1047659.1040315"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3656391"},{"key":"e_1_3_2_1_22_1","volume-title":"Partial-order methods for the verification of concurrent systems: an approach to the state-explosion problem","author":"Godefroid Patrice","unstructured":"Patrice Godefroid. 1996. Partial-order methods for the verification of concurrent systems: an approach to the state-explosion problem. Springer."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594315"},{"key":"e_1_3_2_1_24_1","volume-title":"3rd USENIX Workshop on Hot Topics in Parallelism (HotPar 11)","author":"Jalbert Nicholas","year":"2011","unstructured":"Nicholas Jalbert, Cristiano Pereira, Gilles Pokam, and Koushik Sen. 2011. {RADBench}: A Concurrency Bug Benchmark Suite. In 3rd USENIX Workshop on Hot Topics in Parallelism (HotPar 11)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3140587.3062374"},{"key":"e_1_3_2_1_26_1","volume-title":"Estimating the efficiency of backtrack programs. Mathematics of computation","author":"Knuth Donald E","year":"1975","unstructured":"Donald E Knuth. 1975. Estimating the efficiency of backtrack programs. Mathematics of computation, Vol. 29, 129 (1975), 122--136."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81685-8_20"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CONCUR.2021.16"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1993.274940"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3579856.3595787"},{"key":"e_1_3_2_1_31_1","unstructured":"LightFTP. 2015. GitHub - hfiref0x\/LightFTP: A small x86--32\/x64 FTP Server. https:\/\/github.com\/hfiref0x\/LightFTP. Accessed 01-05--2024."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274694.3274718"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1346281.1346323"},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of the ACM on Programming Languages","volume":"2","author":"Majumdar Rupak","year":"2017","unstructured":"Rupak Majumdar and Filip Niksic. 2017. Why is random testing effective for partition tolerance bugs? Proceedings of the ACM on Programming Languages, Vol. 2, POPL (2017), 1--24."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177730491"},{"key":"e_1_3_2_1_36_1","first-page":"163","article-title":"Evaluation of survival data and two new rank order statistics arising in its consideration","volume":"50","author":"Mantel Nathan","year":"1966","unstructured":"Nathan Mantel. 1966. Evaluation of survival data and two new rank order statistics arising in its consideration. Cancer Chemother Rep, Vol. 50, 3 (1966), 163--170.","journal-title":"Cancer Chemother Rep"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276515"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373718.3394783"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3434317"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378475"},{"key":"e_1_3_2_1_41_1","volume-title":"Computationally tractable classes of ordered sets","author":"M\u00f6hring Rolf H","unstructured":"Rolf H M\u00f6hring. 1989. Computationally tractable classes of ordered sets. L. Rival, ed. Algorithms and Order."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3428298"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855741.1855760"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254128"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276530"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3360606"},{"key":"e_1_3_2_1_47_1","volume-title":"Proceedings of the ACM on Programming Languages","volume":"4","author":"Pavlogiannis Andreas","year":"2019","unstructured":"Andreas Pavlogiannis. 2019. Fast, sound, and effectively complete dynamic race prediction. Proceedings of the ACM on Programming Languages, Vol. 4, POPL (2019), 1--29."},{"key":"e_1_3_2_1_48_1","unstructured":"RaceBenchData. 2023. RaceBenchData: a synthetic concurrency bug dataset. https:\/\/github.com\/rb130\/RaceBenchData. Accessed 20-04--2024."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3385993"},{"key":"e_1_3_2_1_50_1","unstructured":"SCTBench. 2016. SCTBench: a set of C\/C pthread benchmarks for evaluating concurrency testing techniques. https:\/\/github.com\/mc-imperial\/sctbench. Accessed 2024-04-01."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321631.1321679"},{"key":"e_1_3_2_1_52_1","volume-title":"Haifa verification conference","author":"Sen Koushik","unstructured":"Koushik Sen and Gul Agha. 2006. A race-detection and flipping algorithm for automated testing of multi-threaded programs. In Haifa verification conference. Springer, 166--182."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35632-2_16"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1791194.1791203"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3597503.3639099"},{"key":"e_1_3_2_1_56_1","unstructured":"Shuttle. 2021. GitHub - awslabs\/shuttle: a library for testing concurrent Rust code. https:\/\/github.com\/awslabs\/shuttle. Accessed 20-04--2024."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cl.2004.02.002"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103702"},{"key":"e_1_3_2_1_59_1","unstructured":"SweynTooth. 2020. SweynTooth: Bluetooth Vulnerabilities Expose Many Devices to Attacks -- Securityweek.com. https:\/\/www.securityweek.com\/sweyntooth-bluetooth-vulnerabilities-expose-many-devices-attacks\/."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11528"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2858651"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3591291"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3510003.3510178"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00383444"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/3620665.3640389"},{"key":"e_1_3_2_1_66_1","volume-title":"Jaswinder Pal Singh, and Anoop Gupta","author":"Woo Steven Cameron","year":"1995","unstructured":"Steven Cameron Woo, Moriyoshi Ohara, Evan Torrie, Jaswinder Pal Singh, and Anoop Gupta. 1995. The SPLASH-2 programs: Characterization and methodological considerations. ACM SIGARCH computer architecture news, Vol. 23, 2 (1995), 24--36."},{"key":"e_1_3_2_1_67_1","volume-title":"Inspect: A runtime model checker for multithreaded C programs. Technical Report. Technical Report UUCS-08-004","author":"Yang Yu","year":"2008","unstructured":"Yu Yang, Xiaofang Chen, and Ganesh Gopalakrishnan. 2008. Inspect: A runtime model checker for multithreaded C programs. Technical Report. Technical Report UUCS-08-004, University of Utah."},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555815.1555796"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/2384616.2384651"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96142-2_20"}],"event":{"name":"ASPLOS '25: 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems","location":"Rotterdam Netherlands","acronym":"ASPLOS '25","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGOPS ACM Special Interest Group on Operating Systems","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 1"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3669940.3707214","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3669940.3707214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T14:52:28Z","timestamp":1755787948000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3669940.3707214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,30]]},"references-count":70,"alternative-id":["10.1145\/3669940.3707214","10.1145\/3669940"],"URL":"https:\/\/doi.org\/10.1145\/3669940.3707214","relation":{},"subject":[],"published":{"date-parts":[[2025,3,30]]},"assertion":[{"value":"2025-03-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}