{"id":"https://openalex.org/W4296613475","doi":"https://doi.org/10.1145/3534927","title":"A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions","display_name":"A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions","publication_year":2022,"publication_date":"2022-09-22","ids":{"openalex":"https://openalex.org/W4296613475","doi":"https://doi.org/10.1145/3534927"},"language":"en","primary_location":{"id":"doi:10.1145/3534927","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3534927","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"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":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://orbit.dtu.dk/en/publications/0189cd99-f648-418f-81b0-25341138ade4","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089189715","display_name":"Christoph Matheja","orcid":"https://orcid.org/0000-0001-9151-0441"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Christoph Matheja","raw_affiliation_strings":["Technical University of Denmark and ETH Zurich, Kgs Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Technical University of Denmark and ETH Zurich, Kgs Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063559919","display_name":"Jens Katelaan","orcid":"https://orcid.org/0000-0002-8211-767X"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Jens Pagel","raw_affiliation_strings":["TU Wien, Wien, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063337176","display_name":"Florian Zuleger","orcid":"https://orcid.org/0000-0003-1468-8398"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Florian Zuleger","raw_affiliation_strings":["TU Wien, Wien, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089189715"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":null,"apc_paid":null,"fwci":1.1106,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.8164524,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"24","issue":"1","first_page":"1","last_page":"76"},"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.9994000196456909,"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.9994000196456909,"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.994700014591217,"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/T11567","display_name":"semigroups and automata theory","score":0.9918000102043152,"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.8406507968902588},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7042322158813477},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.701317310333252},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.677294135093689},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5313207507133484},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.387262761592865},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34922993183135986},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3156234920024872},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31472498178482056}],"concepts":[{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.8406507968902588},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7042322158813477},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.701317310333252},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.677294135093689},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5313207507133484},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.387262761592865},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34922993183135986},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3156234920024872},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31472498178482056}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3534927","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3534927","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"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":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/0189cd99-f648-418f-81b0-25341138ade4","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/0189cd99-f648-418f-81b0-25341138ade4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"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":"Matheja , C , Pagel , J & Zuleger , F 2023 , ' A Decision Procedure for Guarded Separation Logic: Complete Entailment Checking for Separation Logic with Inductive Definitions ' , ACM Transactions on Computational Logic , vol. 24 , no. 1 , 1 . https://doi.org/10.1145/3534927","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/0189cd99-f648-418f-81b0-25341138ade4","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/0189cd99-f648-418f-81b0-25341138ade4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"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":"Matheja , C , Pagel , J & Zuleger , F 2023 , ' A Decision Procedure for Guarded Separation Logic: Complete Entailment Checking for Separation Logic with Inductive Definitions ' , ACM Transactions on Computational Logic , vol. 24 , no. 1 , 1 . https://doi.org/10.1145/3534927","raw_type":"article"},"sustainable_development_goals":[{"score":0.8100000023841858,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1579960190","https://openalex.org/W1992012690","https://openalex.org/W2018547229","https://openalex.org/W2025750846","https://openalex.org/W2045388381","https://openalex.org/W2087403174","https://openalex.org/W2123056643","https://openalex.org/W2477674116","https://openalex.org/W2512685755","https://openalex.org/W2626106541","https://openalex.org/W2766959447","https://openalex.org/W2860675612","https://openalex.org/W2901454403","https://openalex.org/W2963581951","https://openalex.org/W2992863903","https://openalex.org/W3004864368","https://openalex.org/W3032212576","https://openalex.org/W3040941623","https://openalex.org/W3124330872","https://openalex.org/W7028570583"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W2119045600","https://openalex.org/W2584984136","https://openalex.org/W2170336571","https://openalex.org/W2962928105","https://openalex.org/W2020140696","https://openalex.org/W4234189135"],"abstract_inverted_index":{"We":[0,58],"develop":[1],"a":[2,81,137],"doubly":[3,82],"exponential":[4,83],"decision":[5,62,84],"procedure":[6,63,85],"for":[7,47,86,119,130],"the":[8,45,50,69,104,114,127],"satisfiability":[9],"problem":[10,129],"of":[11,18,34,49,74,96,103,109],"guarded":[12],"separation":[13,19,75,110],"logic":[14,20],"\u2014a":[15],"novel":[16],"fragment":[17,73],"featuring":[21],"user-supplied":[22],"inductive":[23,93],"predicates,":[24],"Boolean":[25],"connectives,":[26,29],"and":[27,38],"separating":[28],"including":[30],"restricted":[31],"(guarded)":[32],"versions":[33],"negation,":[35],"magic":[36],"wand,":[37],"septraction.":[39],"Moreover,":[40],"we":[41,79,124],"show":[42],"that":[43,126],"dropping":[44],"guards":[46],"any":[48],"preceding":[51],"connectives":[52],"leads":[53],"to":[54,64],"an":[55],"undecidable":[56],"fragment.":[57],"further":[59],"apply":[60],"our":[61],"reason":[65],"about":[66],"entailments":[67,87,120],"in":[68,121],"popular":[70],"symbolic":[71,90],"heap":[72],"logic.":[76,111],"In":[77],"particular,":[78],"obtain":[80],"between":[88],"(quantifier-free)":[89],"heaps":[91],"with":[92,113],"predicate":[94],"definitions":[95],"bounded":[97],"treewidth":[98],"(":[99],"SL":[100,131],"btw":[101,132],")\u2014one":[102],"most":[105],"expressive":[106],"decidable":[107],"fragments":[108],"Together":[112],"recently":[115],"shown":[116],"2ExpTime":[117,134],"-hardness":[118],"said":[122],"fragment,":[123],"conclude":[125],"entailment":[128],"is":[133],"-complete\u2014thereby":[135],"closing":[136],"previously":[138],"open":[139],"complexity":[140],"gap.":[141]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}