{"id":"https://openalex.org/W2075663841","doi":"https://doi.org/10.1145/1296907.1296908","title":"Separation logic and concurrent resource management","display_name":"Separation logic and concurrent resource management","publication_year":2007,"publication_date":"2007-10-21","ids":{"openalex":"https://openalex.org/W2075663841","doi":"https://doi.org/10.1145/1296907.1296908","mag":"2075663841"},"language":"en","primary_location":{"id":"doi:10.1145/1296907.1296908","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1296907.1296908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th international symposium on Memory management","raw_type":"proceedings-article"},"type":"article","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/A5068136684","display_name":"Peter W. O\u2019Hearn","orcid":null},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Peter O'Hearn","raw_affiliation_strings":["Queen Mary: University of London, London, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Queen Mary: University of London, London, United Kingdom","institution_ids":["https://openalex.org/I166337079"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068136684"],"corresponding_institution_ids":["https://openalex.org/I166337079"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.10372213,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"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.9968000054359436,"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.9968000054359436,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9966999888420105,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9714000225067139,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.877260684967041},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.8016413450241089},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7626144886016846},{"id":"https://openalex.org/keywords/concurrent-constraint-logic-programming","display_name":"Concurrent constraint logic programming","score":0.6398966908454895},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6049649715423584},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5567198991775513},{"id":"https://openalex.org/keywords/temporal-logic-of-actions","display_name":"Temporal logic of actions","score":0.5034670233726501},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.497731477022171},{"id":"https://openalex.org/keywords/concurrent-data-structure","display_name":"Concurrent data structure","score":0.48454251885414124},{"id":"https://openalex.org/keywords/mirroring","display_name":"Mirroring","score":0.47508421540260315},{"id":"https://openalex.org/keywords/bunched-logic","display_name":"Bunched logic","score":0.4262956976890564},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3772193491458893},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3232092261314392},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.29527080059051514},{"id":"https://openalex.org/keywords/functional-logic-programming","display_name":"Functional logic programming","score":0.14257055521011353},{"id":"https://openalex.org/keywords/multimodal-logic","display_name":"Multimodal logic","score":0.13712602853775024},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.10009399056434631},{"id":"https://openalex.org/keywords/inductive-programming","display_name":"Inductive programming","score":0.09852409362792969},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09837836027145386}],"concepts":[{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.877260684967041},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.8016413450241089},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7626144886016846},{"id":"https://openalex.org/C204306468","wikidata":"https://www.wikidata.org/wiki/Q5159106","display_name":"Concurrent constraint logic programming","level":5,"score":0.6398966908454895},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6049649715423584},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5567198991775513},{"id":"https://openalex.org/C11648818","wikidata":"https://www.wikidata.org/wiki/Q2403081","display_name":"Temporal logic of actions","level":4,"score":0.5034670233726501},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.497731477022171},{"id":"https://openalex.org/C203222032","wikidata":"https://www.wikidata.org/wiki/Q5159104","display_name":"Concurrent data structure","level":3,"score":0.48454251885414124},{"id":"https://openalex.org/C189645446","wikidata":"https://www.wikidata.org/wiki/Q350865","display_name":"Mirroring","level":2,"score":0.47508421540260315},{"id":"https://openalex.org/C80467683","wikidata":"https://www.wikidata.org/wiki/Q4997446","display_name":"Bunched logic","level":5,"score":0.4262956976890564},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3772193491458893},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3232092261314392},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.29527080059051514},{"id":"https://openalex.org/C96315309","wikidata":"https://www.wikidata.org/wiki/Q5508829","display_name":"Functional logic programming","level":4,"score":0.14257055521011353},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.13712602853775024},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.10009399056434631},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.09852409362792969},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09837836027145386},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C3845977","wikidata":"https://www.wikidata.org/wiki/Q4826262","display_name":"Autoepistemic logic","level":4,"score":0.0},{"id":"https://openalex.org/C46312422","wikidata":"https://www.wikidata.org/wiki/Q11024","display_name":"Communication","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1296907.1296908","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1296907.1296908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th international symposium on Memory management","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:1380397","is_oa":false,"landing_page_url":"http://discovery.ucl.ac.uk/1380397/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"     In:    (pp. 1-).   (2007)     ","raw_type":"Proceedings paper"}],"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/W2148687959","https://openalex.org/W3194921765","https://openalex.org/W2144482530","https://openalex.org/W3136970019","https://openalex.org/W4247835804","https://openalex.org/W2154768716","https://openalex.org/W2495367456","https://openalex.org/W2142642467","https://openalex.org/W2125398300","https://openalex.org/W2583319020"],"abstract_inverted_index":{"Concurrent":[0],"separation":[1,83],"logic":[2,19],"provides":[3],"a":[4],"way":[5],"of":[6,11,24,26,28,45,57,62,69,80],"reasoning":[7],"about":[8],"the":[9,18,22,42,78,81,105],"usage":[10],"resources":[12],"in":[13,17],"concurrent":[14,31,37,47,82],"programs.":[15,39],"Proofs":[16],"all":[20],"track":[21],"transfer":[23],"ownership":[25],"portions":[27],"memory":[29,52],"between":[30],"processes,":[32],"mirroring":[33],"design":[34],"principles":[35],"for":[36],"systems":[38],"This":[40],"allows":[41],"safe":[43],"treatment":[44],"\"daring\"":[46],"programs,":[48],"that":[49,96],"access":[50],"shared":[51],"without":[53],"explicit":[54],"protection,":[55],"outside":[56],"critical":[58],"sections;":[59],"canonical":[60],"examples":[61],"such":[63],"daring":[64],"concurrency":[65],"are":[66,97],"resource":[67],"managers":[68],"various":[70],"kinds.":[71],"In":[72],"this":[73],"talk":[74],"I":[75],"will":[76],"describe":[77],"underpinnings":[79],"logic,":[84],"andallillustrate":[85],"it":[86],"with":[87,104],"experimental":[88],"tools":[89],"--":[90,95],"SMALLFOOT":[91],"and":[92],"SPACE":[93],"INVADER":[94],"being":[98],"developed":[99],"to":[100],"do":[101],"automatic":[102],"proofs":[103],"logic.":[106]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}