{"id":"https://openalex.org/W4414978552","doi":"https://doi.org/10.1145/3763123","title":"Efficient Decrease-and-Conquer Linearizability Monitoring","display_name":"Efficient Decrease-and-Conquer Linearizability Monitoring","publication_year":2025,"publication_date":"2025-10-09","ids":{"openalex":"https://openalex.org/W4414978552","doi":"https://doi.org/10.1145/3763123"},"language":"en","primary_location":{"id":"doi:10.1145/3763123","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3763123","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1145/3763123","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5119914626","display_name":"Zheng Han Lee","orcid":"https://orcid.org/0009-0000-7130-2493"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Zheng Han Lee","raw_affiliation_strings":["National University of Singapore, Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"National University of Singapore, Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016958234","display_name":"Umang Mathur","orcid":"https://orcid.org/0000-0002-7610-0660"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Umang Mathur","raw_affiliation_strings":["National University of Singapore, Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"National University of Singapore, Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5119914626"],"corresponding_institution_ids":["https://openalex.org/I165932596"],"apc_list":null,"apc_paid":null,"fwci":1.6666,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.88891118,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"9","issue":"OOPSLA2","first_page":"2030","last_page":"2057"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12127","display_name":"Software System Performance and Reliability","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/linearizability","display_name":"Linearizability","score":0.9545000195503235},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7720000147819519},{"id":"https://openalex.org/keywords/concurrent-data-structure","display_name":"Concurrent data structure","score":0.5733000040054321},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4984999895095825},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4778999984264374},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.45399999618530273},{"id":"https://openalex.org/keywords/component","display_name":"Component (thermodynamics)","score":0.41269999742507935}],"concepts":[{"id":"https://openalex.org/C20528329","wikidata":"https://www.wikidata.org/wiki/Q513932","display_name":"Linearizability","level":3,"score":0.9545000195503235},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7720000147819519},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7473000288009644},{"id":"https://openalex.org/C203222032","wikidata":"https://www.wikidata.org/wiki/Q5159104","display_name":"Concurrent data structure","level":3,"score":0.5733000040054321},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4984999895095825},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4778999984264374},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4713999927043915},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.45399999618530273},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.41269999742507935},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.40689998865127563},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.399399995803833},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38519999384880066},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.353300005197525},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.32850000262260437},{"id":"https://openalex.org/C84511453","wikidata":"https://www.wikidata.org/wiki/Q2914952","display_name":"Concurrency control","level":3,"score":0.31839999556541443},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.3070000112056732},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.28290000557899475},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2662000060081482},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.2646999955177307},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.25209999084472656}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3763123","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3763123","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3763123","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3763123","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W1717387230","https://openalex.org/W1818449680","https://openalex.org/W1898066328","https://openalex.org/W1919495026","https://openalex.org/W1965452160","https://openalex.org/W1965614349","https://openalex.org/W1981393723","https://openalex.org/W1982100000","https://openalex.org/W1986463648","https://openalex.org/W1996246466","https://openalex.org/W2031348459","https://openalex.org/W2069297655","https://openalex.org/W2082679906","https://openalex.org/W2101939036","https://openalex.org/W2128551356","https://openalex.org/W2131041673","https://openalex.org/W2145919405","https://openalex.org/W2149074552","https://openalex.org/W2149426263","https://openalex.org/W2162022306","https://openalex.org/W2398645059","https://openalex.org/W2511114427","https://openalex.org/W2546854465","https://openalex.org/W2563167692","https://openalex.org/W2780745892","https://openalex.org/W2794155582","https://openalex.org/W2887814217","https://openalex.org/W2914645210","https://openalex.org/W2951734910","https://openalex.org/W2979942385","https://openalex.org/W2995880861","https://openalex.org/W2996703997","https://openalex.org/W3000335052","https://openalex.org/W3011029566","https://openalex.org/W3012447579","https://openalex.org/W3032865144","https://openalex.org/W3114146851","https://openalex.org/W3117594589","https://openalex.org/W3184331482","https://openalex.org/W3194987967","https://openalex.org/W4308644269","https://openalex.org/W4379512374","https://openalex.org/W4379536496","https://openalex.org/W4382045603","https://openalex.org/W4384471334","https://openalex.org/W4390603423","https://openalex.org/W4390604995","https://openalex.org/W4390605117","https://openalex.org/W4390605256","https://openalex.org/W4394744337","https://openalex.org/W4402442587","https://openalex.org/W4406221732","https://openalex.org/W4411267048","https://openalex.org/W4411269417","https://openalex.org/W7077150636"],"related_works":[],"abstract_inverted_index":{"Linearizability":[0],"has":[1,25,105],"become":[2],"the":[3,38,65,169,182,198,229,238,257,265],"de":[4],"facto":[5],"standard":[6],"for":[7,120,168,181,207,226,263],"specifying":[8],"correctness":[9],"of":[10,12,40,64,100,151,171,189,194,200,259,267,279],"implementations":[11,20,278],"concurrent":[13,80,210,280],"data":[14,81,211,240,261,281],"structures.":[15],"While":[16,86],"formally":[17],"verifying":[18],"such":[19,54,152],"remains":[21],"challenging,":[22],"linearizability":[23,66,122,183],"monitoring":[24,67,184],"emerged":[26],"as":[27,45],"a":[28,46,79,97,115,136,164,177,243],"promising":[29],"first":[30,113],"step":[31],"to":[32,71,92,130,237,251,288],"rule":[33],"out":[34],"early":[35],"problems":[36],"in":[37,49,95,135],"development":[39],"custom":[41],"implementations,":[42],"and":[43,112,154,218,273,292],"serves":[44],"key":[47],"component":[48],"approaches":[50],"that":[51,163,234,284],"stress":[52],"test":[53],"implementations.":[55],"In":[56],"this":[57,87,110,127,190],"work,":[58],"we":[59,161],"undertake":[60],"an":[61,74,144],"algorithmic":[62,118],"investigation":[63],"problem,":[68,185],"which":[69],"asks":[70,129],"check":[72],"if":[73],"execution":[75],"history":[76,138],"obtained":[77],"from":[78],"structure":[82,241],"implementation":[83,272],"is":[84,89],"linearizable.":[85],"problem":[88,111,170,191],"largely":[90],"understood":[91],"be":[93],"intractable":[94],"general,":[96],"systematic":[98],"understanding":[99],"when":[101],"it":[102,206],"becomes":[103],"tractable":[104],"remained":[106],"elusive.":[107],"We":[108,196,246],"revisit":[109],"present":[114],"unified":[116],"\u2018decrease-and-conquer\u2019":[117],"framework":[119,128,203],"designing":[121],"monitoring.":[123,195],"At":[124],"its":[125],"heart,":[126],"identify":[131],"special":[132],"linearizability-preserving":[133,173],"values":[134,140],"given":[137],"\u2014":[139,213,221],"whose":[141,155],"presence":[142],"yields":[143,176],"equi-linearizable":[145],"sub-history":[146],"(obtained":[147],"by":[148,204],"removing":[149],"operations":[150],"values),":[153],"absence":[156],"indicates":[157],"non-linearizability.":[158],"More":[159],"importantly,":[160],"prove":[162],"polynomial":[165,178,223],"time":[166,179,224,255],"algorithm":[167,180],"identifying":[172],"values,":[174],"immediately":[175],"while":[186],"conversely,":[187],"intractability":[188,193],"implies":[192],"demonstrate":[197],"effectiveness":[199],"our":[201,285],"decrease-and-conquer":[202],"instantiating":[205],"several":[208],"popular":[209],"types":[212],"registers,":[214],"sets,":[215],"stacks,":[216],"queues":[217,220],"priority":[219],"deriving":[222],"algorithms":[225,250],"them,":[227],"under":[228],"(":[230],"unambiguity":[231],")":[232],"restriction":[233],"each":[235],"insertion":[236],"underlying":[239],"adds":[242],"distinct":[244],"value.":[245],"further":[247],"optimize":[248],"these":[249],"achieve":[252],"log-linear":[253],"running":[254],"through":[256],"use":[258],"efficient":[260],"structures":[262,282],"amortizing":[264],"cost":[266],"solving":[268],"induced":[269],"sub-problems.":[270],"Our":[271],"evaluation":[274],"on":[275],"publicly":[276],"available":[277],"show":[283],"approach":[286],"scales":[287],"very":[289],"large":[290],"histories":[291],"significantly":[293],"outperforms":[294],"existing":[295],"state-of-the-art":[296],"tools.":[297]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}