{"id":"https://openalex.org/W4245321046","doi":"https://doi.org/10.1145/1993498.1993565","title":"Precise and compact modular procedure summaries for heap manipulating programs","display_name":"Precise and compact modular procedure summaries for heap manipulating programs","publication_year":2011,"publication_date":"2011-06-04","ids":{"openalex":"https://openalex.org/W4245321046","doi":"https://doi.org/10.1145/1993498.1993565"},"language":"en","primary_location":{"id":"doi:10.1145/1993498.1993565","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993498.1993565","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/A5006424908","display_name":"I\u015f\u0131l Dillig","orcid":"https://orcid.org/0000-0001-8006-1230"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Isil Dillig","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074844638","display_name":"Thomas Dillig","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Dillig","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087402475","display_name":"Alex Aiken","orcid":"https://orcid.org/0000-0002-3723-9555"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alex Aiken","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"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"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5006424908"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":7.2688,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.97126748,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"567","last_page":"577"},"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.9994999766349792,"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.9994999766349792,"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/T10260","display_name":"Software Engineering Research","score":0.9991999864578247,"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"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9384642839431763},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7874910831451416},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.6322054266929626},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6155404448509216},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.552087664604187},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5176706314086914},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.433206707239151},{"id":"https://openalex.org/keywords/static-analysis","display_name":"Static analysis","score":0.4166601300239563},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3376459777355194},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.33743762969970703},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.16662916541099548}],"concepts":[{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.9384642839431763},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7874910831451416},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.6322054266929626},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6155404448509216},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.552087664604187},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5176706314086914},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.433206707239151},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.4166601300239563},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3376459777355194},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33743762969970703},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.16662916541099548}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1993498.1993565","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993498.1993565","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1533634404","https://openalex.org/W1974604404","https://openalex.org/W2036157748","https://openalex.org/W2077850509","https://openalex.org/W2080573945","https://openalex.org/W2139668965","https://openalex.org/W2140809377","https://openalex.org/W2147492162","https://openalex.org/W2154985136","https://openalex.org/W2914074464","https://openalex.org/W3004911069","https://openalex.org/W3123906889"],"related_works":["https://openalex.org/W2019887508","https://openalex.org/W2761428514","https://openalex.org/W3035018584","https://openalex.org/W2867457158","https://openalex.org/W4297908618","https://openalex.org/W2765641823","https://openalex.org/W3111646971","https://openalex.org/W2895825088","https://openalex.org/W4387793661","https://openalex.org/W3186878187"],"abstract_inverted_index":{"We":[0,24,52],"present":[1,26],"a":[2,27,42],"strictly":[3],"bottom-up,":[4],"summary-based,":[5],"and":[6,50,56,66],"precise":[7],"heap":[8,19,30],"analysis":[9,44],"targeted":[10],"for":[11,61],"program":[12],"verification":[13,62],"that":[14,32,46],"performs":[15],"strong":[16],"updates":[17],"to":[18],"locations":[20],"at":[21],"call":[22],"sites.":[23],"first":[25],"theory":[28],"of":[29,36,58,63],"decompositions":[31],"forms":[33],"the":[34,54],"basis":[35],"our":[37,59],"approach;":[38],"we":[39],"then":[40],"describe":[41],"full":[43],"algorithm":[45],"is":[47],"fully":[48],"symbolic":[49],"efficient.":[51],"demonstrate":[53],"precision":[55],"scalability":[57],"approach":[60],"real":[64],"C":[65],"C++":[67],"programs.":[68]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}