{"id":"https://openalex.org/W2005354109","doi":"https://doi.org/10.1109/lics.2013.18","title":"Quantitative Reasoning for Proving Lock-Freedom","display_name":"Quantitative Reasoning for Proving Lock-Freedom","alternate_titles":[],"publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2005354109","doi":"https://doi.org/10.1109/lics.2013.18","mag":"2005354109"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2013.18","doi":"https://doi.org/10.1109/lics.2013.18","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2013.18","pdf_url":null,"source":{"id":"https://openalex.org/S4210192682","display_name":"ACM/IEEE Symposium on Logic in Computer Science (LICS)","issn_l":"1043-6871","issn":["1043-6871","2575-5528"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2005354109"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101496943","display_name":"Jan Hoffmann","orcid":"https://orcid.org/0000-0001-8326-0788","observed_orcids":["https://orcid.org/0000-0001-8326-0788"]},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jan Hoffmann","raw_affiliation_strings":["Yale University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yale University, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072110496","display_name":"Michael Marmar","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Marmar","raw_affiliation_strings":["Yale University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yale University, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070627140","display_name":"Zhong Shao","orcid":"https://orcid.org/0000-0001-8184-7649","observed_orcids":["https://orcid.org/0000-0001-8184-7649"]},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhong Shao","raw_affiliation_strings":["Yale University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yale University, USA","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":null,"apc_paid":null,"fwci":1.7802,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.85077411,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"124","last_page":"133"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.98580002784729,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.98580002784729,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10142","display_name":"Formal Methods in Verification","score":0.008200000040233135,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.003700000001117587,"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/lock-freedom","display_name":"lock-freedom","score":0.9890000224113464},{"id":"https://openalex.org/keywords/quantitative-reasoning","display_name":"quantitative reasoning","score":0.8980000019073486},{"id":"https://openalex.org/keywords/concurrent-separation-logic","display_name":"concurrent separation logic","score":0.9679999947547913},{"id":"https://openalex.org/keywords/total-correctness","display_name":"total correctness","score":0.8849999904632568},{"id":"https://openalex.org/keywords/memory-safety","display_name":"memory safety","score":0.6539999842643738},{"id":"https://openalex.org/keywords/program-logic","display_name":"program logic","score":0.7360000014305115}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8890528678894043},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7909108400344849},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7884508371353149},{"id":"https://openalex.org/C174839445","wikidata":"https://www.wikidata.org/wiki/Q1134386","display_name":"Lock (firearm)","level":2,"score":0.7024579048156738},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.5385535359382629},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.5289266705513},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5184047222137451},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.47127529978752136},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.4400673806667328},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.43827447295188904},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.41001415252685547},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3874092102050781},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.145707905292511},{"id":"https://openalex.org/C558565934","wikidata":"https://www.wikidata.org/wiki/Q2743","display_name":"Musical","level":2,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/lics.2013.18","doi":"https://doi.org/10.1109/lics.2013.18","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2013.18","pdf_url":null,"source":{"id":"https://openalex.org/S4210192682","display_name":"ACM/IEEE Symposium on Logic in Computer Science (LICS)","issn_l":"1043-6871","issn":["1043-6871","2575-5528"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.406.9505","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.9505","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://flint.cs.yale.edu/flint/publications/lockfree-tr.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.407.800","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.407.800","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://flint.cs.yale.edu/flint/publications/lockfree.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G1726331178","display_name":"TC:Small: Formal Reasoning about Concurrent Programs for Multicore and Multiprocessor Machines","funder_award_id":"0915888","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1889560887","display_name":null,"funder_award_id":"12-2-0293","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G789317362","display_name":null,"funder_award_id":"FA8750-12-2-0293","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G8542633891","display_name":null,"funder_award_id":"FA8750-10-2-0254","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G8954270533","display_name":"TC: Medium: Making OS Kernels Crash-Proof by Design and Certification","funder_award_id":"1065451","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8987182439","display_name":"TC:Large:Collaborative Research:Combininig Foundational and Lightweight Formal Methods to Build Certifiably Dependable Software","funder_award_id":"0910670","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W1513633483","https://openalex.org/W1520380662","https://openalex.org/W1775146113","https://openalex.org/W1819989006","https://openalex.org/W1824790454","https://openalex.org/W1965662337","https://openalex.org/W1972955159","https://openalex.org/W1973894849","https://openalex.org/W1974265510","https://openalex.org/W1981393723","https://openalex.org/W2008132476","https://openalex.org/W2037683502","https://openalex.org/W2039408243","https://openalex.org/W2042668508","https://openalex.org/W2061341742","https://openalex.org/W2068055184","https://openalex.org/W2072035527","https://openalex.org/W2075373350","https://openalex.org/W2080769562","https://openalex.org/W2083096988","https://openalex.org/W2085407655","https://openalex.org/W2100357382","https://openalex.org/W2101939036","https://openalex.org/W2124945255","https://openalex.org/W2132761501","https://openalex.org/W2136739578","https://openalex.org/W2137507504","https://openalex.org/W2137628566","https://openalex.org/W2138657070","https://openalex.org/W2145878518","https://openalex.org/W2166666675","https://openalex.org/W2167282885","https://openalex.org/W2168690953","https://openalex.org/W2171685273","https://openalex.org/W2378259225","https://openalex.org/W2408512871","https://openalex.org/W2508779702","https://openalex.org/W2987907651","https://openalex.org/W3006137651","https://openalex.org/W3023751354","https://openalex.org/W4237730680","https://openalex.org/W4253344502","https://openalex.org/W4256027310"],"related_works":["https://openalex.org/W1513633483","https://openalex.org/W7006782737","https://openalex.org/W2038454881","https://openalex.org/W1973894849","https://openalex.org/W2521130604","https://openalex.org/W7100005445","https://openalex.org/W2909341085","https://openalex.org/W2187653458","https://openalex.org/W2060813200","https://openalex.org/W2107688173"],"abstract_inverted_index":{"This":[0,67],"article":[1,68],"describes":[2],"a":[3,48,58,80,98,118],"novel":[4],"quantitative":[5,27,75,92],"proof":[6,61,76],"technique":[7,77,151],"for":[8,41,51,87,100],"the":[9,42,112,139,150,156],"modular":[10],"and":[11,55,106,135,168],"local":[12],"verification":[13,43],"of":[14,44,73,82,114,141,158],"lock-freedom.":[15],"In":[16],"contrast":[17],"to":[18,103,124,154],"proofs":[19],"based":[20],"on":[21,111],"temporal":[22],"rely-guarantee":[23],"requirements,":[24],"this":[25,74],"new":[26],"reasoning":[28,128],"method":[29],"can":[30],"be":[31],"directly":[32],"integrated":[33],"in":[34,117,131],"modern":[35],"program":[36],"logics":[37],"that":[38,62,164],"are":[39],"designed":[40],"safety":[45,54],"properties.":[46],"Using":[47],"single":[49],"formalism":[50],"verifying":[52,138],"memory":[53],"lock-freedom":[56,140,157],"allows":[57],"combined":[59],"correctness":[60],"verifies":[63],"both":[64,133],"properties":[65],"simultaneously.":[66],"presents":[69],"one":[70],"possible":[71],"formalization":[72],"by":[78,137],"developing":[79],"variant":[81],"concurrent":[83],"separation":[84],"logic":[85],"(CSL)":[86],"total":[88],"correctness.":[89],"To":[90],"enable":[91],"reasoning,":[93],"CSL":[94],"is":[95,121,129,147,152],"extended":[96],"with":[97],"predicate":[99],"affine":[101],"tokens":[102],"account":[104],"for,":[105],"provide":[107],"an":[108],"upper":[109],"bound":[110],"number":[113],"loop":[115],"iterations":[116],"program.":[119],"Lock-freedom":[120],"then":[122],"reduced":[123],"total-correctness":[125],"proofs.":[126],"Quantitative":[127],"demonstrated":[130],"detail,":[132],"informally":[134],"formally,":[136],"Treiber's":[142],"non-blocking":[143],"stack.":[144],"Furthermore,":[145],"it":[146],"shown":[148],"how":[149],"used":[153],"verify":[155],"more":[159],"advanced":[160],"shared-memory":[161],"data":[162],"structures":[163],"use":[165],"elimination-backoff":[166],"schemes":[167],"hazard-pointers.":[169]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2005354109","counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
