{"id":"https://openalex.org/W3031363853","doi":"https://doi.org/10.29007/vkmj","title":"Beyond Symbolic Heaps: Deciding Separation Logic With Inductive Definitions","display_name":"Beyond Symbolic Heaps: Deciding Separation Logic With Inductive Definitions","publication_year":2020,"publication_date":"2020-05-27","ids":{"openalex":"https://openalex.org/W3031363853","doi":"https://doi.org/10.29007/vkmj","mag":"3031363853"},"language":"en","primary_location":{"id":"doi:10.29007/vkmj","is_oa":true,"landing_page_url":"https://doi.org/10.29007/vkmj","pdf_url":"https://easychair.org/publications/open/VTGk","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/VTGk","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jens Pagel","orcid":null},"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":true,"raw_author_name":"Jens Pagel","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, 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, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":0.9514,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.80858308,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"73","issue":null,"first_page":"390","last_page":"370"},"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.9991999864578247,"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.9991999864578247,"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.9947999715805054,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9940999746322632,"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.9059618711471558},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.647832989692688},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.6314857602119446},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5301799774169922},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.5195406079292297},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4277172088623047},{"id":"https://openalex.org/keywords/logical-consequence","display_name":"Logical consequence","score":0.4269246459007263},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.42384108901023865},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4072694182395935},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40231484174728394},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3946727216243744},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32115620374679565},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1662425696849823}],"concepts":[{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.9059618711471558},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.647832989692688},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.6314857602119446},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5301799774169922},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.5195406079292297},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4277172088623047},{"id":"https://openalex.org/C134752490","wikidata":"https://www.wikidata.org/wiki/Q374182","display_name":"Logical consequence","level":2,"score":0.4269246459007263},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.42384108901023865},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4072694182395935},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40231484174728394},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3946727216243744},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32115620374679565},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1662425696849823}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.29007/vkmj","is_oa":true,"landing_page_url":"https://doi.org/10.29007/vkmj","pdf_url":"https://easychair.org/publications/open/VTGk","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.29007/vkmj","is_oa":true,"landing_page_url":"https://doi.org/10.29007/vkmj","pdf_url":"https://easychair.org/publications/open/VTGk","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.44999998807907104},{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3031363853.pdf","grobid_xml":"https://content.openalex.org/works/W3031363853.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W122465024","https://openalex.org/W135237429","https://openalex.org/W564852913","https://openalex.org/W634201214","https://openalex.org/W1562865234","https://openalex.org/W1565541828","https://openalex.org/W1580779595","https://openalex.org/W1581674879","https://openalex.org/W1757770995","https://openalex.org/W1910824881","https://openalex.org/W1974265510","https://openalex.org/W1992012690","https://openalex.org/W2045388381","https://openalex.org/W2103490167","https://openalex.org/W2108611287","https://openalex.org/W2130162474","https://openalex.org/W2137628566","https://openalex.org/W2148687959","https://openalex.org/W2294722445","https://openalex.org/W2395497157","https://openalex.org/W2543538425","https://openalex.org/W2766959447","https://openalex.org/W2785797961","https://openalex.org/W2809698264","https://openalex.org/W2901454403","https://openalex.org/W2930217943","https://openalex.org/W2963581951","https://openalex.org/W2985895390","https://openalex.org/W3004864368","https://openalex.org/W3010227999","https://openalex.org/W4250682300"],"related_works":["https://openalex.org/W1790417275","https://openalex.org/W4296607663","https://openalex.org/W1501276147","https://openalex.org/W2115969784","https://openalex.org/W2950271872","https://openalex.org/W2241234471","https://openalex.org/W4283582377","https://openalex.org/W1544998733","https://openalex.org/W1535039583","https://openalex.org/W3136261533"],"abstract_inverted_index":{"Symbolic-heap":[0],"separation":[1,62,105],"logic":[2,106],"with":[3,31,107],"inductive":[4,69],"definitions":[5,70],"is":[6,24],"a":[7,32,48,53,104],"popular":[8],"formalism":[9],"for":[10],"reasoning":[11],"about":[12],"heap-manipulating":[13],"programs.":[14],"The":[15],"fragment":[16],"SLIDbtw":[17],"introduced":[18],"by":[19,46],"Iosif,":[20],"Rogalewicz":[21],"and":[22,80,91,112,119],"Simacek,":[23],"one":[25],"of":[26,67,97,103,115],"the":[27,42,68,77,95,98],"most":[28],"expressive":[29],"fragments":[30],"decidable":[33],"entailment":[34],"problem.":[35],"In":[36,57],"recent":[37],"work,":[38],"we":[39,60],"improved":[40],"on":[41,65],"original":[43],"decidability":[44,90,96],"proof":[45],"providing":[47],"direct":[49],"model-theoretic":[50],"construction,":[51],"obtaining":[52],"2-Exptime":[54],"upper":[55],"bound.":[56],"this":[58],"paper,":[59],"investigate":[61],"logics":[63,74],"built":[64],"top":[66],"from":[71],"SLIDbtw,":[72],"i.e.,":[73],"that":[75,123],"feature":[76],"standard":[78],"Boolean":[79],"separation-logic":[81],"operators.":[82],"We":[83,93,121],"give":[84],"an":[85],"almost":[86],"tight":[87],"delineation":[88],"between":[89],"undecidabilty.":[92],"establish":[94],"satisfiability":[99],"problem":[100],"(in":[101],"2-Exptime)":[102],"conjunction,":[108],"disjunction,":[109],"separating":[110],"conjunction":[111],"guarded":[113],"forms":[114],"negation,":[116],"magic":[117],"wand,":[118],"septraction.":[120],"show":[122],"any":[124],"further":[125],"generalization":[126],"leads":[127],"to":[128],"undecidabilty":[129],"(under":[130],"mild":[131],"assumptions).":[132]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}