{"id":"https://openalex.org/W1976401986","doi":"https://doi.org/10.1145/2535838.2535854","title":"Modular reasoning about heap paths via effectively propositional formulas","display_name":"Modular reasoning about heap paths via effectively propositional formulas","publication_year":2014,"publication_date":"2014-01-08","ids":{"openalex":"https://openalex.org/W1976401986","doi":"https://doi.org/10.1145/2535838.2535854","mag":"1976401986"},"language":"en","primary_location":{"id":"doi:10.1145/2535838.2535854","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2535838.2535854","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","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/A5010920313","display_name":"Shachar Itzhaky","orcid":"https://orcid.org/0000-0002-7276-7644"},"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":"Shachar Itzhaky","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003706361","display_name":"Anindya Banerjee","orcid":"https://orcid.org/0000-0001-9979-1292"},"institutions":[{"id":"https://openalex.org/I105140100","display_name":"Madrid Institute for Advanced Studies","ror":"https://ror.org/027pk6j83","country_code":"ES","type":"education","lineage":["https://openalex.org/I105140100"]},{"id":"https://openalex.org/I4210162154","display_name":"IMDEA Software","ror":"https://ror.org/04xvfkh51","country_code":"ES","type":"facility","lineage":["https://openalex.org/I105140100","https://openalex.org/I4210162154"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Anindya Banerjee","raw_affiliation_strings":["IMDEA Software Institute, Madrid, Spain","IMDEA Software Institute, Madrid, Spain#TAB#"],"affiliations":[{"raw_affiliation_string":"IMDEA Software Institute, Madrid, Spain","institution_ids":["https://openalex.org/I4210162154"]},{"raw_affiliation_string":"IMDEA Software Institute, Madrid, Spain#TAB#","institution_ids":["https://openalex.org/I105140100"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053065200","display_name":"Neil Immerman","orcid":"https://orcid.org/0000-0001-6609-5952"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]},{"id":"https://openalex.org/I177605424","display_name":"Amherst College","ror":"https://ror.org/028vqfs63","country_code":"US","type":"education","lineage":["https://openalex.org/I177605424"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neil Immerman","raw_affiliation_strings":["UMASS Amherst, Amherst, MA, USA","UMass, Amherst, Amherst, MA, USA"],"affiliations":[{"raw_affiliation_string":"UMASS Amherst, Amherst, MA, USA","institution_ids":["https://openalex.org/I177605424"]},{"raw_affiliation_string":"UMass, Amherst, Amherst, MA, USA","institution_ids":["https://openalex.org/I177605424","https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102734862","display_name":"Ori Lahav","orcid":"https://orcid.org/0000-0003-4305-6998"},"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":"Ori Lahav","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026624853","display_name":"Aleksandar Nanevski","orcid":"https://orcid.org/0000-0002-4851-1075"},"institutions":[{"id":"https://openalex.org/I105140100","display_name":"Madrid Institute for Advanced Studies","ror":"https://ror.org/027pk6j83","country_code":"ES","type":"education","lineage":["https://openalex.org/I105140100"]},{"id":"https://openalex.org/I4210162154","display_name":"IMDEA Software","ror":"https://ror.org/04xvfkh51","country_code":"ES","type":"facility","lineage":["https://openalex.org/I105140100","https://openalex.org/I4210162154"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Aleksandar Nanevski","raw_affiliation_strings":["IMDEA Software Institute, Madrid, Spain","IMDEA Software Institute, Madrid, Spain#TAB#"],"affiliations":[{"raw_affiliation_string":"IMDEA Software Institute, Madrid, Spain","institution_ids":["https://openalex.org/I4210162154"]},{"raw_affiliation_string":"IMDEA Software Institute, Madrid, Spain#TAB#","institution_ids":["https://openalex.org/I105140100"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002512849","display_name":"Mooly Sagiv","orcid":null},"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":"Mooly Sagiv","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5010920313"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":7.1885,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.96927616,"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":"385","last_page":"396"},"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.9995999932289124,"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.9995999932289124,"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.9987000226974487,"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.991100013256073,"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/heap","display_name":"Heap (data structure)","score":0.8045947551727295},{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.6862719058990479},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6686429977416992},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.649074375629425},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.6270278692245483},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5649582147598267},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.49542462825775146},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.48538053035736084},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.4842795729637146},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4840902090072632},{"id":"https://openalex.org/keywords/functional-verification","display_name":"Functional verification","score":0.41898638010025024},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.4145733714103699},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3575340211391449},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2695867419242859},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.20442268252372742}],"concepts":[{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.8045947551727295},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.6862719058990479},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6686429977416992},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.649074375629425},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.6270278692245483},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5649582147598267},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.49542462825775146},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.48538053035736084},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.4842795729637146},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4840902090072632},{"id":"https://openalex.org/C62460635","wikidata":"https://www.wikidata.org/wiki/Q5508853","display_name":"Functional verification","level":3,"score":0.41898638010025024},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.4145733714103699},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3575340211391449},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2695867419242859},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.20442268252372742}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2535838.2535854","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2535838.2535854","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.645.2916","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.645.2916","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.cs.umass.edu/~immerman/pub/POPL2014.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.646.2722","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.2722","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://software.imdea.org/~aleks/papers/reachability/popl14.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.800000011920929,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W12427088","https://openalex.org/W100246148","https://openalex.org/W120571988","https://openalex.org/W1500085611","https://openalex.org/W1508482211","https://openalex.org/W1511668635","https://openalex.org/W1552065586","https://openalex.org/W1576911972","https://openalex.org/W1580779595","https://openalex.org/W1974265510","https://openalex.org/W1975156572","https://openalex.org/W1976401986","https://openalex.org/W1979619055","https://openalex.org/W1986022261","https://openalex.org/W1988441831","https://openalex.org/W1998838326","https://openalex.org/W1999468161","https://openalex.org/W2009489912","https://openalex.org/W2044772623","https://openalex.org/W2094160561","https://openalex.org/W2101811836","https://openalex.org/W2123631714","https://openalex.org/W2138245690","https://openalex.org/W2147650421","https://openalex.org/W2160563691","https://openalex.org/W4236835455","https://openalex.org/W4238367836","https://openalex.org/W4241183813","https://openalex.org/W4256027310"],"related_works":["https://openalex.org/W2963892764","https://openalex.org/W4296607663","https://openalex.org/W4290679430","https://openalex.org/W1481101394","https://openalex.org/W4283582377","https://openalex.org/W2594835963","https://openalex.org/W4390605114","https://openalex.org/W3102946249","https://openalex.org/W62586952","https://openalex.org/W1548444083"],"abstract_inverted_index":{"First":[0],"order":[1],"logic":[2,8,149],"with":[3,150],"transitive":[4,151],"closure,":[5],"and":[6,19,37,97,105,110,139,160,165,174],"separation":[7],"enable":[9],"elegant":[10],"interactive":[11],"verification":[12,29,54,140],"of":[13,23,30,52,55,58,94,102,147,183],"heap-manipulating":[14,59],"programs.":[15],"However,":[16],"undecidabilty":[17],"results":[18],"high":[20],"asymptotic":[21],"complexity":[22],"checking":[24],"validity":[25],"preclude":[26],"complete":[27,164],"automatic":[28],"such":[31],"programs,":[32],"even":[33],"when":[34],"loop":[35,111],"invariants":[36,112],"procedure":[38,89],"contracts":[39,109],"are":[40,66],"specified":[41],"as":[42],"formulas":[43],"in":[44,118,130],"these":[45],"logics.":[46],"This":[47],"paper":[48],"tackles":[49],"the":[50,119,181],"problem":[51],"procedure-modular":[53],"reachability":[56,125],"properties":[57],"programs":[60,185],"using":[61],"efficient":[62,166],"decision":[63],"procedures":[64],"that":[65,68,123,153,179,186],"complete:":[67],"is,":[69],"a":[70,75,78,91,99,131,145,170],"SAT":[71],"solver":[72],"must":[73],"generate":[74],"counterexample":[76],"whenever":[77],"program":[79,108,137],"does":[80],"not":[81],"satisfy":[82],"its":[83],"specification.":[84],"By":[85],"(a)":[86],"requiring":[87],"each":[88],"modifies":[90],"fixed":[92],"set":[93],"heap":[95,103,124],"partitions":[96],"creates":[98],"bounded":[100],"amount":[101],"sharing,":[104],"(b)":[106],"restricting":[107],"to":[113,142,156],"use":[114],"only":[115],"deterministic":[116],"paths":[117],"heap,":[120],"we":[121],"show":[122],"updates":[126],"can":[127],"be":[128],"described":[129],"simple":[132],"manner.":[133],"The":[134],"restrictions":[135],"force":[136],"specifications":[138],"conditions":[141],"lie":[143],"within":[144],"fragment":[146],"first-order":[148],"closure":[152],"is":[154],"reducible":[155],"effectively":[157],"propositional":[158],"logic,":[159],"hence":[161],"facilitate":[162],"sound,":[163],"verification.":[167],"We":[168],"implemented":[169],"tool":[171],"atop":[172],"Z3":[173],"report":[175],"on":[176],"preliminary":[177],"experiments":[178],"establish":[180],"correctness":[182],"several":[184],"manipulate":[187],"linked":[188],"data":[189],"structures.":[190]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5}],"updated_date":"2026-04-11T08:14:18.477133","created_date":"2025-10-10T00:00:00"}