{"id":"https://openalex.org/W4414944828","doi":"https://doi.org/10.1007/978-3-032-04167-8_5","title":"Deciding Satisfiability for\u00a0Overlaid Symbolic Heaps","display_name":"Deciding Satisfiability for\u00a0Overlaid Symbolic Heaps","publication_year":2025,"publication_date":"2025-09-14","ids":{"openalex":"https://openalex.org/W4414944828","doi":"https://doi.org/10.1007/978-3-032-04167-8_5"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-032-04167-8_5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-04167-8_5","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-04167-8_5.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-04167-8_5.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079985573","display_name":"Nicolas Peltier","orcid":"https://orcid.org/0000-0002-8943-7000"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210104430","display_name":"Laboratoire d'Informatique de Grenoble","ror":"https://ror.org/01c8rcg82","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210104430","https://openalex.org/I4210159245","https://openalex.org/I899635006","https://openalex.org/I899635006"]},{"id":"https://openalex.org/I899635006","display_name":"Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/02rx3b187","country_code":"FR","type":"education","lineage":["https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Nicolas Peltier","raw_affiliation_strings":["Univ. Grenoble Alpes, CNRS, LIG, 38000, Grenoble, France"],"raw_orcid":"https://orcid.org/0000-0002-8943-7000","affiliations":[{"raw_affiliation_string":"Univ. Grenoble Alpes, CNRS, LIG, 38000, Grenoble, France","institution_ids":["https://openalex.org/I4210104430","https://openalex.org/I1294671590","https://openalex.org/I899635006"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5095897499","display_name":"Quentin Petitjean","orcid":"https://orcid.org/0009-0004-6504-8336"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Quentin Petitjean","raw_affiliation_strings":["Univ. Paris-Saclay, ENS Paris-Saclay, CNRS, LMF, 91190, Gif-sur-Yvette, France"],"raw_orcid":"https://orcid.org/0009-0004-6504-8336","affiliations":[{"raw_affiliation_string":"Univ. Paris-Saclay, ENS Paris-Saclay, CNRS, LMF, 91190, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047029242","display_name":"Mihaela Sighireanu","orcid":"https://orcid.org/0000-0002-1925-089X"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mihaela Sighireanu","raw_affiliation_strings":["Univ. Paris-Saclay, ENS Paris-Saclay, CNRS, LMF, 91190, Gif-sur-Yvette, France"],"raw_orcid":"https://orcid.org/0000-0002-1925-089X","affiliations":[{"raw_affiliation_string":"Univ. Paris-Saclay, ENS Paris-Saclay, CNRS, LMF, 91190, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5079985573"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210104430","https://openalex.org/I899635006"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.62779553,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"80","last_page":"97"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11159","display_name":"Manufacturing Process and Optimization","score":0.9771999716758728,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11159","display_name":"Manufacturing Process and Optimization","score":0.9771999716758728,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10260","display_name":"Software Engineering Research","score":0.9006999731063843,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/satisfiability","display_name":"Satisfiability","score":0.7418000102043152},{"id":"https://openalex.org/keywords/presburger-arithmetic","display_name":"Presburger arithmetic","score":0.7312999963760376},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7103000283241272},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.597599983215332},{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.5924000144004822},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.5195000171661377},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.5084999799728394},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4584999978542328},{"id":"https://openalex.org/keywords/succinctness","display_name":"Succinctness","score":0.37599998712539673},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.3718000054359436}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7523999810218811},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7418000102043152},{"id":"https://openalex.org/C5852641","wikidata":"https://www.wikidata.org/wiki/Q956059","display_name":"Presburger arithmetic","level":3,"score":0.7312999963760376},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7103000283241272},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.597599983215332},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.5924000144004822},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5313000082969666},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.5195000171661377},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.5084999799728394},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.49480000138282776},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4584999978542328},{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.37599998712539673},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.3718000054359436},{"id":"https://openalex.org/C59656382","wikidata":"https://www.wikidata.org/wiki/Q191536","display_name":"Conjunction (astronomy)","level":2,"score":0.3626999855041504},{"id":"https://openalex.org/C124656256","wikidata":"https://www.wikidata.org/wiki/Q6897882","display_name":"Monadic predicate calculus","level":4,"score":0.36149999499320984},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3578999936580658},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.3553999960422516},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32989999651908875},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.32670000195503235},{"id":"https://openalex.org/C39685927","wikidata":"https://www.wikidata.org/wiki/Q173183","display_name":"Boolean algebra","level":2,"score":0.32100000977516174},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.3160000145435333},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31029999256134033},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.30809998512268066},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.30169999599456787},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29750001430511475},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C7655956","wikidata":"https://www.wikidata.org/wiki/Q5282259","display_name":"Disjoint union (topology)","level":2,"score":0.2939999997615814},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.2906999886035919},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.2791000008583069},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.27799999713897705},{"id":"https://openalex.org/C65620979","wikidata":"https://www.wikidata.org/wiki/Q7661176","display_name":"Symbolic data analysis","level":2,"score":0.27559998631477356},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.2741999924182892},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.27379998564720154},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C203264685","wikidata":"https://www.wikidata.org/wiki/Q2328174","display_name":"Atomic formula","level":2,"score":0.2705000042915344},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.257999986410141},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.2574999928474426},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.2572000026702881}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-032-04167-8_5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-04167-8_5","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-04167-8_5.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-05143101v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05143101","pdf_url":"https://hal.science/hal-05143101/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"FROCOS 2025 - 15th International Symposium on Frontiers of Combining Systems, Sep 2025, Reykjavik, Iceland","raw_type":"Conference papers"}],"best_oa_location":{"id":"doi:10.1007/978-3-032-04167-8_5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-04167-8_5","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-04167-8_5.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6903635557","display_name":null,"funder_award_id":"ANR-21-CE48-0011","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414944828.pdf","grobid_xml":"https://content.openalex.org/works/W4414944828.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W65162005","https://openalex.org/W1506554338","https://openalex.org/W1607550340","https://openalex.org/W1737601775","https://openalex.org/W1833029986","https://openalex.org/W1910824881","https://openalex.org/W2011193467","https://openalex.org/W2102913701","https://openalex.org/W2103490167","https://openalex.org/W2130162474","https://openalex.org/W2137628566","https://openalex.org/W2157148396","https://openalex.org/W2157390113","https://openalex.org/W2168838065","https://openalex.org/W2341060778","https://openalex.org/W2780286008","https://openalex.org/W3091716098","https://openalex.org/W4256027310","https://openalex.org/W4296613475","https://openalex.org/W4366503835","https://openalex.org/W4366723555","https://openalex.org/W4384918562"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Separation":[1],"logic":[2,56,123],"(SL)":[3],"is":[4,107],"a":[5,55,61,121],"widely":[6],"used":[7],"formalism":[8],"for":[9,104],"verifying":[10],"programs":[11],"that":[12,57,76,100],"manipulate":[13],"dynamically":[14],"allocated":[15],"memory,":[16],"relying":[17],"on":[18],"the":[19,39,69,92,101,115],"separating":[20,63],"conjunction":[21,64],"$$\\star":[22],"$$":[23],"<mml:math":[24],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[25],"<mml:mo>\u22c6</mml:mo>":[26],"</mml:math>":[27],"to":[28,42,90,114],"combine":[29],"disjoint":[30],"heap":[31],"structures.":[32,97],"The":[33],"standard":[34],"approach":[35],"in":[36,108,118],"SL":[37,59],"lacks":[38],"expressive":[40],"power":[41],"handle":[43],"overlaid":[44],"data":[45],"structures":[46,49],"where":[47],"multiple":[48],"share":[50],"some":[51],"locations.":[52],"We":[53,98],"consider":[54],"extends":[58],"with":[60,73],"new":[62],"operator":[65],"\"Image":[66],"missing\",":[67],"enabling":[68],"composition":[70],"of":[71,127],"heaps":[72],"shared":[74,94],"locations":[75,93],"allocate":[77],"distinct":[78],"fields.":[79],"Our":[80],"fragment":[81,106],"supports":[82],"generic":[83],"inductive":[84],"definitions":[85],"and":[86,129],"introduces":[87],"set":[88],"variables":[89],"constrain":[91],"by":[95,111],"overlapping":[96],"prove":[99],"satisfiability":[102,116],"problem":[103,117],"this":[105],"Nexptime":[109],",":[110],"reducing":[112],"it":[113],"BAPA":[119],"[11],":[120],"decidable":[122],"combining":[124],"Boolean":[125],"algebra":[126],"sets":[128],"Presburger":[130],"arithmetic.":[131]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}