{"id":"https://openalex.org/W2002292019","doi":"https://doi.org/10.1145/1273920.1273941","title":"Local reasoning about storable locks","display_name":"Local reasoning about storable locks","publication_year":2007,"publication_date":"2007-07-14","ids":{"openalex":"https://openalex.org/W2002292019","doi":"https://doi.org/10.1145/1273920.1273941","mag":"2002292019"},"language":"en","primary_location":{"id":"doi:10.1145/1273920.1273941","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1273920.1273941","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming","raw_type":"proceedings-article"},"type":"conference-abstract","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/A5061050156","display_name":"Josh Berdine","orcid":"https://orcid.org/0000-0002-9691-1348"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB","US"],"is_corresponding":true,"raw_author_name":"Josh Berdine","raw_affiliation_strings":["Microsoft Research, Cambridge, United Kingdom","Microsoft Research, Cambridge, United Kingdom ("],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft Research, Cambridge, United Kingdom (","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061050156"],"corresponding_institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"153","last_page":"153"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.991599977016449,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.9039419889450073},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8004878759384155},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.7228471636772156},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.7128261923789978},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6756157875061035},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.6397204399108887},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.5495043992996216},{"id":"https://openalex.org/keywords/concurrent-data-structure","display_name":"Concurrent data structure","score":0.53233802318573},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4772208333015442},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.4386025071144104}],"concepts":[{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.9039419889450073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8004878759384155},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.7228471636772156},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.7128261923789978},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6756157875061035},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.6397204399108887},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.5495043992996216},{"id":"https://openalex.org/C203222032","wikidata":"https://www.wikidata.org/wiki/Q5159104","display_name":"Concurrent data structure","level":3,"score":0.53233802318573},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4772208333015442},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.4386025071144104}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1273920.1273941","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1273920.1273941","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1607674807","https://openalex.org/W2139241970","https://openalex.org/W4296607663","https://openalex.org/W1481101394","https://openalex.org/W4290679430","https://openalex.org/W2950271872","https://openalex.org/W4283582377","https://openalex.org/W4287240968","https://openalex.org/W2594835963","https://openalex.org/W3102946249"],"abstract_inverted_index":{"This":[0],"talk":[1],"will":[2],"present":[3],"a":[4,59,73],"resource-oriented":[5],"program":[6],"logic":[7,31,50],"that":[8,47,57],"is":[9,32,70],"able":[10],"to":[11,27],"reason":[12],"about":[13,55],"concurrent":[14,35],"heap-manipulating":[15],"programs":[16,56],"with":[17],"unbounded":[18],"numbers":[19],"of":[20,62],"dynamically-allocated":[21],"locks,":[22],"and":[23],"note":[24],"an":[25],"extension":[26],"storable":[28],"threads.":[29],"The":[30],"inspired":[33],"by":[34],"separation":[36],"logic,":[37],"but":[38],"handles":[39],"these":[40],"more":[41],"realistic":[42],"concurrency":[43],"primitives.":[44],"We":[45],"demonstrate":[46],"the":[48],"proposed":[49],"allows":[51],"for":[52],"local":[53],"reasoning":[54],"exhibit":[58],"high":[60],"degree":[61],"information":[63],"hiding":[64],"in":[65],"their":[66],"locking":[67],"mechanisms.":[68],"Soundness":[69],"proved":[71],"using":[72],"novel":[74],"thread-local":[75],"fixed-point":[76],"semantics.":[77]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}