{"id":"https://openalex.org/W2013050211","doi":"https://doi.org/10.1145/1328438.1328469","title":"Relational inductive shape analysis","display_name":"Relational inductive shape analysis","publication_year":2008,"publication_date":"2008-01-07","ids":{"openalex":"https://openalex.org/W2013050211","doi":"https://doi.org/10.1145/1328438.1328469","mag":"2013050211"},"language":"en","primary_location":{"id":"doi:10.1145/1328438.1328469","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328438.1328469","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},"type":"conference-paper","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/A5048756174","display_name":"Bor-Yuh Evan Chang","orcid":"https://orcid.org/0000-0002-1954-0774"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bor-Yuh Evan Chang","raw_affiliation_strings":["University of California: Berkeley, Berkeley, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California: Berkeley, Berkeley, CA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037983866","display_name":"Xavier Rival","orcid":"https://orcid.org/0000-0002-2875-6171"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I29607241","display_name":"\u00c9cole Normale Sup\u00e9rieure - PSL","ror":"https://ror.org/05a0dhs15","country_code":"FR","type":"other","lineage":["https://openalex.org/I2746051580","https://openalex.org/I29607241"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Xavier Rival","raw_affiliation_strings":["INRIA - ENS, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA - ENS, Paris, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I29607241"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":13.5972,"has_fulltext":false,"cited_by_count":158,"citation_normalized_percentile":{"value":0.9935402,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"247","last_page":"260"},"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.9872999787330627,"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.9872999787330627,"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.986299991607666,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9779999852180481,"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/abstract-interpretation","display_name":"Abstract interpretation","score":0.7988525629043579},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7869527339935303},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7625004053115845},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5961160659790039},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5727741122245789},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5683938264846802},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.568344235420227},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.5332750082015991},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.519531786441803},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42236900329589844},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3832043707370758},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.30721086263656616},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.278063029050827},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17078536748886108},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.10672897100448608}],"concepts":[{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.7988525629043579},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7869527339935303},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7625004053115845},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5961160659790039},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5727741122245789},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5683938264846802},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.568344235420227},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.5332750082015991},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.519531786441803},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42236900329589844},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3832043707370758},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.30721086263656616},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.278063029050827},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17078536748886108},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.10672897100448608},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1328438.1328469","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328438.1328469","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.224.43","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.43","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://rw4.cs.uni-saarland.de/teaching/spa10/papers/risa.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W43953174","https://openalex.org/W1503701626","https://openalex.org/W1508811155","https://openalex.org/W1537510808","https://openalex.org/W1539066757","https://openalex.org/W1553910098","https://openalex.org/W1567479568","https://openalex.org/W1606540187","https://openalex.org/W1738877549","https://openalex.org/W1988441831","https://openalex.org/W1991837261","https://openalex.org/W2031373197","https://openalex.org/W2043100293","https://openalex.org/W2060697066","https://openalex.org/W2111513472","https://openalex.org/W2135163511","https://openalex.org/W2137628566","https://openalex.org/W2147832077","https://openalex.org/W2152686702","https://openalex.org/W2153144732","https://openalex.org/W2166858727","https://openalex.org/W2168056516","https://openalex.org/W2170770935","https://openalex.org/W3158747708","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1880843538","https://openalex.org/W2172022734","https://openalex.org/W2114695797","https://openalex.org/W4233387348","https://openalex.org/W3137189469","https://openalex.org/W2952657391","https://openalex.org/W2159835799","https://openalex.org/W2036037832","https://openalex.org/W1483974062","https://openalex.org/W3003422935"],"abstract_inverted_index":{"Shape":[0],"analyses":[1],"are":[2],"concerned":[3],"with":[4],"precise":[5],"abstractions":[6],"of":[7,25,87,117,162,164],"the":[8,88,112,135,140,148,160,165],"heap":[9],"to":[10,20,62,92],"capture":[11],"detailed":[12],"structural":[13,48],"properties.":[14],"To":[15],"do":[16],"so,":[17],"they":[18],"need":[19],"build":[21,124],"and":[22,52,66,83,101,103,143,151],"decompose":[23],"summaries":[24,110],"disjoint":[26,39],"memory":[27],"regions.":[28],"Unfortunately,":[29],"many":[30],"data":[31,45,81,89,102,152],"structure":[32,90],"invariants":[33,46,49,91,98,168],"require":[34],"relations":[35],"be":[36],"tracked":[37],"across":[38],"regions,":[40],"such":[41],"as":[42],"intricate":[43],"numerical":[44],"or":[47,115],"concerning":[50],"back":[51],"cross":[53],"pointers.":[54],"In":[55],"this":[56,121],"paper,":[57],"we":[58,123],"identify":[59],"issues":[60],"inherent":[61],"analyzing":[63],"relational":[64],"structures":[65],"design":[67],"an":[68,76],"abstract":[69,77,141],"domain":[70,78],"that":[71,138],"is":[72],"parameterized":[73],"both":[74],"by":[75,84],"for":[79,108],"pure":[80],"properties":[82],"user-supplied":[85,136],"specifications":[86,137],"check.":[93],"Particularly,":[94],"it":[95],"supports":[96],"hybrid":[97],"about":[99],"shape":[100,126,150],"features":[104],"a":[105,125,132,144],"generic":[106],"mechanism":[107],"materializing":[109],"at":[111],"beginning,":[113],"middle,":[114],"end":[116],"inductive":[118],"structures.":[119],"Around":[120],"domain,":[122],"analysis":[127],"whose":[128],"interesting":[129],"components":[130],"include":[131],"pre-analysis":[133],"on":[134,159],"guides":[139],"interpretation":[142],"widening":[145],"operator":[146],"over":[147],"combined":[149],"domain.":[153],"We":[154],"then":[155],"demonstrate":[156],"our":[157],"techniques":[158],"proof":[161],"preservation":[163],"red-black":[166],"tree":[167],"during":[169],"insertion.":[170]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":18},{"year":2013,"cited_by_count":26},{"year":2012,"cited_by_count":12}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}