{"id":"https://openalex.org/W7106852104","doi":"https://doi.org/10.1145/3776671","title":"Separating the Wheat from the Chaff: Understanding (In-)Completeness of Proof Mechanisms for Separation Logic with Inductive Definitions","display_name":"Separating the Wheat from the Chaff: Understanding (In-)Completeness of Proof Mechanisms for Separation Logic with Inductive Definitions","publication_year":2026,"publication_date":"2026-01-08","ids":{"openalex":"https://openalex.org/W7106852104","doi":"https://doi.org/10.1145/3776671"},"language":"en","primary_location":{"id":"doi:10.1145/3776671","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3776671","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1145/3776671","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Neta Elad","orcid":"https://orcid.org/0000-0002-5503-5791"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Neta Elad","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":"https://orcid.org/0000-0002-5503-5791","affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Adithya Murali","orcid":"https://orcid.org/0000-0002-6311-1467"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Adithya Murali","raw_affiliation_strings":["University of Wisconsin-Madison, Madison, USA"],"raw_orcid":"https://orcid.org/0000-0002-6311-1467","affiliations":[{"raw_affiliation_string":"University of Wisconsin-Madison, Madison, USA","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":null,"display_name":"Sharon Shoham","orcid":"https://orcid.org/0000-0002-7226-3526"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Sharon Shoham","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":"https://orcid.org/0000-0002-7226-3526","affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02247171,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"POPL","first_page":"833","last_page":"864"},"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.5985000133514404,"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.5985000133514404,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.18359999358654022,"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.12049999833106995,"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.921500027179718},{"id":"https://openalex.org/keywords/separation","display_name":"Separation (statistics)","score":0.474700003862381},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.461899995803833},{"id":"https://openalex.org/keywords/inductive-reasoning","display_name":"Inductive reasoning","score":0.44909998774528503},{"id":"https://openalex.org/keywords/bunched-logic","display_name":"Bunched logic","score":0.4415999948978424},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.3612000048160553},{"id":"https://openalex.org/keywords/inductive-logic-programming","display_name":"Inductive logic programming","score":0.35830000042915344},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.3513000011444092}],"concepts":[{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.921500027179718},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.633400022983551},{"id":"https://openalex.org/C2776061190","wikidata":"https://www.wikidata.org/wiki/Q7451805","display_name":"Separation (statistics)","level":2,"score":0.474700003862381},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.461899995803833},{"id":"https://openalex.org/C21563000","wikidata":"https://www.wikidata.org/wiki/Q484511","display_name":"Inductive reasoning","level":2,"score":0.44909998774528503},{"id":"https://openalex.org/C80467683","wikidata":"https://www.wikidata.org/wiki/Q4997446","display_name":"Bunched logic","level":5,"score":0.4415999948978424},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.3612000048160553},{"id":"https://openalex.org/C2779382394","wikidata":"https://www.wikidata.org/wiki/Q1464197","display_name":"Inductive logic programming","level":2,"score":0.35830000042915344},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.3513000011444092},{"id":"https://openalex.org/C134752490","wikidata":"https://www.wikidata.org/wiki/Q374182","display_name":"Logical consequence","level":2,"score":0.334199994802475},{"id":"https://openalex.org/C2993131915","wikidata":"https://www.wikidata.org/wiki/Q484511","display_name":"Inductive method","level":3,"score":0.3314000070095062},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.328000009059906},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3043000102043152},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.30320000648498535},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.2994999885559082},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.29260000586509705},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28360000252723694},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2833000123500824},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.2624000012874603},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.26190000772476196},{"id":"https://openalex.org/C47884741","wikidata":"https://www.wikidata.org/wiki/Q1166618","display_name":"Mathematical logic","level":2,"score":0.2596000134944916},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25270000100135803},{"id":"https://openalex.org/C124978682","wikidata":"https://www.wikidata.org/wiki/Q1201019","display_name":"Proof of concept","level":2,"score":0.25110000371932983}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3776671","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3776671","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2511.20193","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.20193","pdf_url":"https://arxiv.org/pdf/2511.20193","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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"}],"best_oa_location":{"id":"doi:10.1145/3776671","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3776671","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4408331711","display_name":null,"funder_award_id":"2117/23","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G7464600357","display_name":null,"funder_award_id":"59102-SVIS","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"For":[0],"over":[1,345],"two":[2],"decades":[3],"Separation":[4,31,50,110,135,143,186],"Logic":[5,32,51,111,144,187],"has":[6],"enjoyed":[7],"its":[8,140],"unique":[9],"position":[10],"as":[11,22,24,41,49,109,275],"arguably":[12],"the":[13,66,221,257,284,296,310,330,371,380],"most":[14],"popular":[15],"framework":[16],"for":[17,87,130,197,230,242],"reasoning":[18,25],"about":[19,26],"heap-manipulating":[20],"programs,":[21],"well":[23],"shared":[27],"resources":[28],"and":[29,68,76,98,163,207,236,307,319,336,373],"permissions.":[30],"is":[33,47,105,114,119,122,227,256,363],"often":[34],"extended":[35],"to":[36,44,61,69,167,213,295,317,334,365,368],"include":[37],"inductively-defined":[38],"predicates,":[39],"interpreted":[40],"least":[42],"fixpoints,":[43],"form":[45],"what":[46],"known":[48],"with":[52,204,246,350],"Inductive":[53],"Definitions":[54],"(SLID).":[55],"These":[56,301],"inductive":[57,208,247,351],"predicates":[58],"are":[59,96,304],"used":[60],"describe":[62],"unbounded":[63],"data-structures":[64],"in":[65,82,134],"heap":[67],"verify":[70],"key":[71],"properties":[72],"thereof.":[73],"Many":[74],"theoretical":[75],"practical":[77],"advances":[78],"have":[79],"been":[80],"made":[81],"developing":[83],"automated":[84,152],"proof":[85,129,170,224,238,262,273,388],"mechanisms":[86,95,171],"SLID,":[88,193,231],"but":[89,291],"by":[90,289],"their":[91,103],"very":[92,141],"nature":[93],"these":[94,159],"imperfect,":[97],"a":[99,128,178,198,211,234,325,353,376],"deeper":[100],"understanding":[101],"of":[102,148,161,169,172,201,240,260,267,286,299,314,332,355,370,379],"failures":[104,168,274],"desired.":[106],"As":[107],"expressive":[108],"is,":[112],"it":[113,118,338],"not":[115,293],"surprising":[116],"that":[117,125,150,182,191,220,254,281,328],"incomplete:":[120],"there":[121],"no":[123],"procedure":[124],"will":[126],"provide":[127,375],"all":[131],"valid":[132],"entailments":[133,203,245],"Logic.":[136],"In":[137,154,249],"fact,":[138],"at":[139],"core,":[142],"contains":[145,344],"several":[146],"sources":[147,160],"incompleteness":[149,162],"defy":[151],"reasoning.":[153],"this":[155,252,265],"paper":[156],"we":[157,183,218,271,308,374],"study":[158],"how":[164],"they":[165],"relate":[166],"SLID.":[173,300],"We":[174,189,323],"contextualize":[175],"SLID":[176,268],"within":[177,269,283],"larger,":[179],"relaxed":[180],"logic,":[181],"call":[184],"Weak":[185],"(WSL).":[188],"prove":[190],"unlike":[192],"WSL":[194,255,333],"enjoys":[195],"completeness":[196],"non-trivial":[199],"fragment":[200],"quantified":[202,347],"background":[205,359],"theories":[206],"definitions,":[209,352],"via":[210],"reduction":[212],"first-order":[214],"logic":[215,259],"(FOL).":[216],"Moreover,":[217],"show":[219],"ubiquitous":[222],"fold/unfold":[223],"mechanism,":[225],"which":[226,343,356],"unsurprisingly":[228],"incomplete":[229],"does":[232],"constitute":[233],"sound":[235],"complete":[237],"mechanism":[239],"WSL,":[241,270,290],"theory-free,":[243],"quantifier-free":[244],"definitions.":[248],"some":[250,384],"sense,":[251],"shows":[253],"natural":[258],"such":[261],"mechanisms.":[263],"Through":[264],"contextualization":[266],"understand":[272],"stemming":[276],"from":[277],"rogue,":[278],"nonstandard":[279],"models,":[280,382],"exist":[282],"class":[285],"models":[287,303],"considered":[288],"do":[292],"adhere":[294],"stricter":[297],"requirements":[298],"rogue":[302,381],"typically":[305],"infinite,":[306],"use":[309],"recently":[311],"proposed":[312],"formalism":[313],"symbolic":[315],"structures":[316],"represent":[318],"automatically":[320],"find":[321,366],"them.":[322],"present":[324],"prototype":[326],"tool":[327,362],"implements":[329],"encoding":[331],"FOL":[335],"test":[337],"on":[339,386],"an":[340],"existing":[341],"benchmark,":[342],"700":[346],"entailment":[348],"problems":[349],"third":[354],"also":[357],"contain":[358],"theories.":[360],"Our":[361],"able":[364],"counter-models":[367],"many":[369],"examples,":[372],"partial":[377],"taxonomy":[378],"shedding":[383],"light":[385],"real-world":[387],"failures.":[389]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-11-28T00:00:00"}