{"id":"https://openalex.org/W4229793125","doi":"https://doi.org/10.1145/1993498.1993563","title":"Separation logic + superposition calculus = heap theorem prover","display_name":"Separation logic + superposition calculus = heap theorem prover","publication_year":2011,"publication_date":"2011-06-04","ids":{"openalex":"https://openalex.org/W4229793125","doi":"https://doi.org/10.1145/1993498.1993563"},"language":"en","primary_location":{"id":"doi:10.1145/1993498.1993563","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993498.1993563","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034937599","display_name":"Juan Antonio P\u00e9rez-Ortiz","orcid":"https://orcid.org/0000-0001-7659-8908"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Juan Antonio Navarro P\u00e9rez","raw_affiliation_strings":["Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044737952","display_name":"Andrey Rybalchenko","orcid":null},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andrey Rybalchenko","raw_affiliation_strings":["Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034937599"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":4.2758,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.94610684,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"556","last_page":"566"},"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.9997000098228455,"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.9997000098228455,"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.9993000030517578,"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.9990000128746033,"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.8797942399978638},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.7361078262329102},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.7193980813026428},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5451220870018005},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.5265372395515442},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.5042070150375366},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.48227933049201965},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.4371548891067505},{"id":"https://openalex.org/keywords/automated-reasoning","display_name":"Automated reasoning","score":0.4351637065410614},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4311788082122803},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4044881761074066},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38363906741142273},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3584859371185303},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.22041845321655273}],"concepts":[{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.8797942399978638},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.7361078262329102},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.7193980813026428},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5451220870018005},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.5265372395515442},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.5042070150375366},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.48227933049201965},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.4371548891067505},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.4351637065410614},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4311788082122803},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4044881761074066},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38363906741142273},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3584859371185303},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.22041845321655273},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1993498.1993563","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993498.1993563","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W189569203","https://openalex.org/W909064011","https://openalex.org/W1507112684","https://openalex.org/W1508482211","https://openalex.org/W1508811155","https://openalex.org/W1544167035","https://openalex.org/W1548444083","https://openalex.org/W1549217957","https://openalex.org/W1557130751","https://openalex.org/W1562865234","https://openalex.org/W1635857625","https://openalex.org/W1983543556","https://openalex.org/W1988441831","https://openalex.org/W1991837261","https://openalex.org/W1993836075","https://openalex.org/W2013050211","https://openalex.org/W2053154567","https://openalex.org/W2091968063","https://openalex.org/W2108611287","https://openalex.org/W2110233633","https://openalex.org/W2130162474","https://openalex.org/W2154985136","https://openalex.org/W2163365446","https://openalex.org/W2295903414","https://openalex.org/W2915057152","https://openalex.org/W3100198463","https://openalex.org/W4242057943","https://openalex.org/W4245524452","https://openalex.org/W4251700176","https://openalex.org/W6603841182","https://openalex.org/W6624129057","https://openalex.org/W6828535928"],"related_works":["https://openalex.org/W4296607663","https://openalex.org/W4290679430","https://openalex.org/W1481101394","https://openalex.org/W4290004727","https://openalex.org/W100569329","https://openalex.org/W2952259356","https://openalex.org/W1448383169","https://openalex.org/W4232354397","https://openalex.org/W4299580234","https://openalex.org/W2963499262"],"abstract_inverted_index":{"Program":[0],"analysis":[1],"and":[2,13,56,87],"verification":[3],"tools":[4,40],"crucially":[5],"depend":[6],"on":[7],"the":[8,33,150],"ability":[9],"to":[10,91,108,149],"symbolically":[11],"describe":[12],"reason":[14],"about":[15],"sets":[16],"of":[17,35,64,131,136,142,145],"program":[18],"behaviors.":[19],"Separation":[20],"logic":[21,43,68,79],"provides":[22],"a":[23,45,88,101],"promising":[24],"foundation":[25],"for":[26,41,61,114,123],"dealing":[27],"with":[28,70,84,93,117,147],"heap":[29],"manipulating":[30],"programs,":[31],"while":[32],"development":[34],"practical":[36],"automated":[37,58],"deduction/satisfiability":[38],"checking":[39,62],"separation":[42,67,78],"is":[44],"challenging":[46],"problem.":[47],"In":[48],"this":[49],"paper,":[50],"we":[51],"present":[52],"an":[53],"efficient,":[54],"sound":[55],"complete":[57],"theorem":[59,75],"prover":[60,76,139],"validity":[63],"entailments":[65],"between":[66,95],"formulas":[69],"list":[71,85],"segment":[72],"predicates.":[73],"Our":[74],"integrates":[77],"inference":[80],"rules":[81],"that":[82,105],"deal":[83,92],"segments":[86],"superposition":[89],"calculus":[90],"equality/aliasing":[94],"memory":[96],"locations.":[97],"The":[98],"integration":[99],"follows":[100],"modular":[102],"combination":[103],"approach":[104],"allows":[106],"one":[107],"directly":[109],"incorporate":[110],"existing":[111],"advanced":[112],"techniques":[113],"first-order":[115],"reasoning":[116],"equality,":[118],"as":[119,121],"well":[120],"account":[122],"additional":[124],"theories,":[125],"e.g.,":[126],"linear":[127],"arithmetic,":[128],"using":[129],"extensions":[130],"superposition.":[132],"An":[133],"experimental":[134],"evaluation":[135],"our":[137],"entailment":[138],"indicates":[140],"speedups":[141],"several":[143],"orders":[144],"magnitude":[146],"respect":[148],"available":[151],"state-of-the-art":[152],"tools.":[153]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}