{"id":"https://openalex.org/W3037762203","doi":"https://doi.org/10.46298/lmcs-17(3:9)2021","title":"ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity","display_name":"ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity","publication_year":2021,"publication_date":"2021-07-21","ids":{"openalex":"https://openalex.org/W3037762203","doi":"https://doi.org/10.46298/lmcs-17(3:9)2021","mag":"3037762203"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-17(3:9)2021","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-17(3:9)2021","pdf_url":"https://lmcs.episciences.org/7708/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/7708/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Dan Frumin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dan Frumin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Robbert Krebbers","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robbert Krebbers","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Lars Birkedal","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lars Birkedal","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8191,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.87406047,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"Volume 17, Issue 3","issue":null,"first_page":null,"last_page":null},"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.9362000226974487,"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.9362000226974487,"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.029200000688433647,"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/T11424","display_name":"Security and Verification in Computing","score":0.007699999958276749,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.8348000049591064},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.7748000025749207},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7540000081062317},{"id":"https://openalex.org/keywords/atomicity","display_name":"Atomicity","score":0.6869999766349792},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.6011999845504761},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.5550000071525574},{"id":"https://openalex.org/keywords/relational-model","display_name":"Relational model","score":0.4036000072956085},{"id":"https://openalex.org/keywords/relational-calculus","display_name":"Relational calculus","score":0.39430001378059387}],"concepts":[{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.8348000049591064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7806000113487244},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.7748000025749207},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7540000081062317},{"id":"https://openalex.org/C188045909","wikidata":"https://www.wikidata.org/wiki/Q3306359","display_name":"Atomicity","level":3,"score":0.6869999766349792},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6617000102996826},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.6011999845504761},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.5550000071525574},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5022000074386597},{"id":"https://openalex.org/C40207289","wikidata":"https://www.wikidata.org/wiki/Q755662","display_name":"Relational model","level":3,"score":0.4036000072956085},{"id":"https://openalex.org/C99436015","wikidata":"https://www.wikidata.org/wiki/Q1722436","display_name":"Relational calculus","level":4,"score":0.39430001378059387},{"id":"https://openalex.org/C2776299755","wikidata":"https://www.wikidata.org/wiki/Q432449","display_name":"Carry (investment)","level":2,"score":0.3849000036716461},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.38440001010894775},{"id":"https://openalex.org/C154564781","wikidata":"https://www.wikidata.org/wiki/Q5384236","display_name":"Equational logic","level":3,"score":0.3741999864578247},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.34220001101493835},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.337799996137619},{"id":"https://openalex.org/C34849589","wikidata":"https://www.wikidata.org/wiki/Q4345785","display_name":"Atomic sentence","level":3,"score":0.3314000070095062},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.3249000012874603},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.3140000104904175},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.3052000105381012},{"id":"https://openalex.org/C80467683","wikidata":"https://www.wikidata.org/wiki/Q4997446","display_name":"Bunched logic","level":5,"score":0.2856000065803528},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.28220000863075256},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2770000100135803},{"id":"https://openalex.org/C47884741","wikidata":"https://www.wikidata.org/wiki/Q1166618","display_name":"Mathematical logic","level":2,"score":0.2612999975681305}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.46298/lmcs-17(3:9)2021","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-17(3:9)2021","pdf_url":"https://lmcs.episciences.org/7708/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire/b2085226-3d2d-45f0-9c15-bdc19f51bfa6","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/b2085226-3d2d-45f0-9c15-bdc19f51bfa6","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frumin, D, Krebbers, R & Birkedal, L 2021, 'ReLoC Reloaded : A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity', Logical Methods in Computer Science, vol. 17, no. 3, 9. https://doi.org/10.46298/lmcs-17(3:9)2021","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.rug.nl:openaire/f9a7e01b-b2ab-4b20-a55f-2dae5692d046","is_oa":true,"landing_page_url":"https://research.rug.nl/en/publications/f9a7e01b-b2ab-4b20-a55f-2dae5692d046","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frumin, D, Krebbers, R & Birkedal, L 2021, 'ReLoC Reloaded : A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity', Logical Methods in Computer Science, vol. 17, no. 3, pp. 9:1\u20139:59. https://doi.org/10.46298/lmcs-17(3:9)2021","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:2006.13635","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2006.13635","pdf_url":"https://arxiv.org/pdf/2006.13635","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/d3eeb5dd-3e21-440a-9903-94e8ae876dab","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2006.13635","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Frumin, D, Krebbers, R & Birkedal, L 2020 'ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity' arxiv.org. < https://arxiv.org/abs/2006.13635 >","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:033e6b3c0b784e0e80d7482843184201","is_oa":true,"landing_page_url":"https://doaj.org/article/033e6b3c0b784e0e80d7482843184201","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 17, Issue 3 (2021)","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/b2085226-3d2d-45f0-9c15-bdc19f51bfa6","is_oa":true,"landing_page_url":"https://lmcs.episciences.org/7708","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Frumin, D, Krebbers, R & Birkedal, L 2021, 'ReLoC Reloaded : A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity', Logical Methods in Computer Science, vol. 17, no. 3, 9. https://doi.org/10.46298/lmcs-17(3:9)2021","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:repository.ubn.ru.nl:2066/235963","is_oa":false,"landing_page_url":"https://repository.ubn.ru.nl/handle/2066/235963","pdf_url":null,"source":{"id":"https://openalex.org/S4306401067","display_name":"Radboud Repository (Radboud University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145872427","host_organization_name":"Radboud University Nijmegen","host_organization_lineage":["https://openalex.org/I145872427"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, 17, 3, pp. 1-59","raw_type":"Article / Letter to editor"},{"id":"pmh:ru:oai:repository.ubn.ru.nl:2066/235963","is_oa":true,"landing_page_url":"http://hdl.handle.net/2066/235963","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, 17, 1 - 59","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-17(3:9)2021","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-17(3:9)2021","pdf_url":"https://lmcs.episciences.org/7708/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4789459991","display_name":null,"funder_award_id":"016.Vidi.189.046","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G8822804239","display_name":null,"funder_award_id":"13563","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G8941266395","display_name":null,"funder_award_id":"016.Veni.192.259","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320322928","display_name":"Danmarks Frie Forskningsfond","ror":"https://ror.org/02sptwz63"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3037762203.pdf","grobid_xml":"https://content.openalex.org/works/W3037762203.grobid-xml"},"referenced_works_count":70,"referenced_works":["https://openalex.org/W75891272","https://openalex.org/W136497439","https://openalex.org/W175195251","https://openalex.org/W1495368328","https://openalex.org/W1527710292","https://openalex.org/W1553228708","https://openalex.org/W1567525491","https://openalex.org/W1808214913","https://openalex.org/W1919495026","https://openalex.org/W1965602413","https://openalex.org/W1974265510","https://openalex.org/W1979328536","https://openalex.org/W1981393723","https://openalex.org/W1981439955","https://openalex.org/W1991984504","https://openalex.org/W2001738739","https://openalex.org/W2011086847","https://openalex.org/W2028861803","https://openalex.org/W2081281361","https://openalex.org/W2085080904","https://openalex.org/W2091015169","https://openalex.org/W2091779700","https://openalex.org/W2096490078","https://openalex.org/W2100559921","https://openalex.org/W2101443478","https://openalex.org/W2101939036","https://openalex.org/W2109084333","https://openalex.org/W2109717427","https://openalex.org/W2114702512","https://openalex.org/W2121405115","https://openalex.org/W2123329569","https://openalex.org/W2125379835","https://openalex.org/W2130505204","https://openalex.org/W2135365827","https://openalex.org/W2135820369","https://openalex.org/W2151716725","https://openalex.org/W2153644103","https://openalex.org/W2162846161","https://openalex.org/W2164719159","https://openalex.org/W2166580349","https://openalex.org/W2402209726","https://openalex.org/W2408292326","https://openalex.org/W2491434057","https://openalex.org/W2514317887","https://openalex.org/W2562833768","https://openalex.org/W2567502494","https://openalex.org/W2577092840","https://openalex.org/W2581223864","https://openalex.org/W2596377803","https://openalex.org/W2596852931","https://openalex.org/W2602388145","https://openalex.org/W2761120147","https://openalex.org/W2776364995","https://openalex.org/W2776685097","https://openalex.org/W2779850521","https://openalex.org/W2796428443","https://openalex.org/W2797640271","https://openalex.org/W2799208700","https://openalex.org/W2885030506","https://openalex.org/W2901454403","https://openalex.org/W2966434214","https://openalex.org/W2978634956","https://openalex.org/W2982041059","https://openalex.org/W2994621632","https://openalex.org/W2994908035","https://openalex.org/W2996703997","https://openalex.org/W3047067898","https://openalex.org/W3108631095","https://openalex.org/W3122350614","https://openalex.org/W3124113140"],"related_works":[],"abstract_inverted_index":{"We":[0,129,163,222],"present":[1],"a":[2,7,41,45,196,233],"new":[3,197,234],"version":[4],"of":[5,14,27,114,134,148,153,185,227],"ReLoC:":[6],"relational":[8,120,127,230],"separation":[9,139],"logic":[10,140],"for":[11,63,73,138,166,202],"proving":[12],"refinements":[13,72],"programs":[15],"with":[16,75,192,232],"higher-order":[17,76],"state,":[18],"fine-grained":[19],"concurrency,":[20,79],"polymorphism":[21],"and":[22,56,78,107,155,180,200],"recursive":[23],"types.":[24],"The":[25,206],"core":[26],"ReLoC":[28,51,131,187,190],"is":[29],"its":[30,90],"refinement":[31,105,159,213],"judgment":[32,88],"$e":[33],"\\precsim":[34],"e'":[35],":":[36],"\\tau$,":[37],"which":[38,122],"states":[39],"that":[40,215],"program":[42,46],"$e$":[43],"refines":[44],"$e'$":[47],"at":[48],"type":[49],"$\\tau$.":[50],"provides":[52],"type-directed":[53],"structural":[54],"rules":[55,59,98],"symbolic":[57],"execution":[58],"in":[60,68,92,141,161,169,178],"separation-logic":[61],"style":[62],"manipulating":[64],"the":[65,87,93,112,119,135,183,219,238],"judgment,":[66],"whereas":[67],"prior":[69],"work":[70],"on":[71,132,237],"languages":[74],"state":[77],"such":[80],"proofs":[81,160,168,214],"were":[82],"carried":[83],"out":[84,104,158,212],"by":[85,241],"unfolding":[86],"into":[89],"definition":[91],"model.":[94],"ReLoC's":[95,225],"abstract":[96],"proof":[97],"make":[99],"it":[100],"simpler":[101],"to":[102,110,118,145,150,156,173,210],"carry":[103,157,211],"proofs,":[106],"enable":[108],"us":[109,144,172,209],"generalize":[111],"notion":[113,226],"logically":[115,125,228],"atomic":[116,126,229],"specifications":[117,231],"case,":[121],"we":[123],"call":[124],"specifications.":[128],"build":[130],"top":[133],"Iris":[136,149],"framework":[137],"Coq,":[142,179],"allowing":[143,171],"leverage":[146],"features":[147],"prove":[151],"soundness":[152],"ReLoC,":[154,170],"ReLoC.":[162,186],"implement":[164],"tactics":[165],"interactive":[167],"mechanize":[174],"several":[175],"case":[176],"studies":[177],"thereby":[181],"demonstrate":[182],"practicality":[184],"Reloaded":[188],"extends":[189],"(LICS'18)":[191],"various":[193],"technical":[194],"improvements,":[195],"Coq":[198],"mechanization,":[199],"support":[201],"Iris's":[203],"prophecy":[204],"variables.":[205],"latter":[207],"allows":[208],"involve":[216],"reasoning":[217],"about":[218],"program's":[220],"future.":[221],"also":[223],"expand":[224],"flavor":[235],"based":[236],"HOCAP":[239],"pattern":[240],"Svendsen":[242],"et":[243],"al.":[244]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2020-07-02T00:00:00"}