{"id":"https://openalex.org/W2562833768","doi":"https://doi.org/10.1145/3009837.3009855","title":"Interactive proofs in higher-order concurrent separation logic","display_name":"Interactive proofs in higher-order concurrent separation logic","publication_year":2016,"publication_date":"2016-12-22","ids":{"openalex":"https://openalex.org/W2562833768","doi":"https://doi.org/10.1145/3009837.3009855","mag":"2562833768"},"language":"en","primary_location":{"id":"doi:10.1145/3009837.3009855","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3009837.3009855","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages","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/A5029418370","display_name":"Robbert Krebbers","orcid":"https://orcid.org/0000-0002-1185-5237"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Robbert Krebbers","raw_affiliation_strings":["Delft University of Technology, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Delft University of Technology, Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030831735","display_name":"Amin Timany","orcid":"https://orcid.org/0000-0002-2237-851X"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Amin Timany","raw_affiliation_strings":["KU Leuven, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KU Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055959064","display_name":"Lars Birkedal","orcid":"https://orcid.org/0000-0003-1320-0098"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lars Birkedal","raw_affiliation_strings":["Aarhus University, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":17.2242,"has_fulltext":false,"cited_by_count":126,"citation_normalized_percentile":{"value":0.99117926,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"205","last_page":"217"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994999766349792,"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/T10142","display_name":"Formal Methods in Verification","score":0.9987000226974487,"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/mathematical-proof","display_name":"Mathematical proof","score":0.747696042060852},{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.7244126200675964},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6892884373664856},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4641394019126892},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.429132878780365},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"First-order logic","score":0.41379889845848083},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3267158269882202},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21287786960601807}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.747696042060852},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.7244126200675964},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6892884373664856},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4641394019126892},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.429132878780365},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.41379889845848083},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3267158269882202},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21287786960601807},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3009837.3009855","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3009837.3009855","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/6b7cf6c0-9edc-48b0-8bee-e1e35e8f36b1","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/6b7cf6c0-9edc-48b0-8bee-e1e35e8f36b1","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Krebbers, R, Timany, A & Birkedal, L 2017, Interactive proofs in higher-order concurrent separation logic. in A D Gordon & G Castagna (eds), Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017. Association for Computing Machinery, pp. 205-217, The 44th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2017), Paris, France, 15/01/2017. https://doi.org/10.1145/3009837.3009855","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320310485","display_name":"Natur og Univers, Det Frie Forskningsr\u00e5d","ror":"https://ror.org/03ge1nb22"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W75891272","https://openalex.org/W86236309","https://openalex.org/W136497439","https://openalex.org/W143008620","https://openalex.org/W169519546","https://openalex.org/W175195251","https://openalex.org/W564852913","https://openalex.org/W1480685649","https://openalex.org/W1508098446","https://openalex.org/W1529227536","https://openalex.org/W1558115254","https://openalex.org/W1565541828","https://openalex.org/W1607674807","https://openalex.org/W1819989006","https://openalex.org/W1824790454","https://openalex.org/W1975808766","https://openalex.org/W2028861803","https://openalex.org/W2035383849","https://openalex.org/W2075373350","https://openalex.org/W2114834520","https://openalex.org/W2123329569","https://openalex.org/W2124461564","https://openalex.org/W2130162474","https://openalex.org/W2132181573","https://openalex.org/W2132818695","https://openalex.org/W2136739578","https://openalex.org/W2147323041","https://openalex.org/W2163806865","https://openalex.org/W2164688709","https://openalex.org/W2213418347","https://openalex.org/W2292986447","https://openalex.org/W2402209726","https://openalex.org/W2408622909","https://openalex.org/W2478126725","https://openalex.org/W2509578035","https://openalex.org/W2596377803","https://openalex.org/W2785851425","https://openalex.org/W4229652664","https://openalex.org/W4235454363","https://openalex.org/W4256124958","https://openalex.org/W4285719527","https://openalex.org/W6678289079","https://openalex.org/W6684323182"],"related_works":["https://openalex.org/W4394650907","https://openalex.org/W154364797","https://openalex.org/W2165970356","https://openalex.org/W9401168","https://openalex.org/W3023197541","https://openalex.org/W4288021755","https://openalex.org/W4250270300","https://openalex.org/W2123186536","https://openalex.org/W2672882003","https://openalex.org/W2735126037"],"abstract_inverted_index":{"When":[0],"using":[1],"a":[2,37],"proof":[3,21,28],"assistant":[4],"to":[5,51],"reason":[6],"in":[7,32],"an":[8],"embedded":[9],"logic":[10,14],"--":[11,15],"like":[12],"separation":[13],"one":[16],"cannot":[17],"benefit":[18],"from":[19],"the":[20,27,53],"contexts":[22],"and":[23],"basic":[24],"tactics":[25],"of":[26,41],"assistant.":[29],"This":[30],"results":[31],"proofs":[33],"that":[34],"are":[35,45],"at":[36],"too":[38],"low":[39],"level":[40],"abstraction":[42],"because":[43],"they":[44],"cluttered":[46],"with":[47],"bookkeeping":[48],"code":[49],"related":[50],"manipulating":[52],"object":[54],"logic.":[55]},"counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":13},{"year":2024,"cited_by_count":17},{"year":2023,"cited_by_count":16},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":18},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":11}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}