{"id":"https://openalex.org/W2139356751","doi":"https://doi.org/10.1145/237721.237724","title":"Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C","display_name":"Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W2139356751","doi":"https://doi.org/10.1145/237721.237724","mag":"2139356751"},"language":"en","primary_location":{"id":"doi:10.1145/237721.237724","doi":"https://doi.org/10.1145/237721.237724","is_oa":false,"landing_page_url":"https://doi.org/10.1145/237721.237724","pdf_url":null,"source":{"id":"https://openalex.org/S7407088133","display_name":"ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2139356751"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5002817835","display_name":"Rakesh Ghiya","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Rakesh Ghiya","raw_affiliation_strings":["School of Computer Science, McGill University, Montr\u00e9al, Qu\u00e9bec, Canada H3A 2A7","School of computer Science, McGill University, Montreal, Quebec, Canada H3A 2A7"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, McGill University, Montr\u00e9al, Qu\u00e9bec, Canada H3A 2A7","institution_ids":["https://openalex.org/I5023651"]},{"raw_affiliation_string":"School of computer Science, McGill University, Montreal, Quebec, Canada H3A 2A7","institution_ids":["https://openalex.org/I5023651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039974849","display_name":"Laurie Jane Hendren","orcid":"https://orcid.org/0000-0001-6755-9632","observed_orcids":["https://orcid.org/0000-0001-6755-9632"]},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Laurie J. Hendren","raw_affiliation_strings":["School of Computer Science, McGill University, Montr\u00e9al, Qu\u00e9bec, Canada H3A 2A7","School of computer Science, McGill University, Montreal, Quebec, Canada H3A 2A7"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, McGill University, Montr\u00e9al, Qu\u00e9bec, Canada H3A 2A7","institution_ids":["https://openalex.org/I5023651"]},{"raw_affiliation_string":"School of computer Science, McGill University, Montreal, Quebec, Canada H3A 2A7","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I5023651"],"apc_list":null,"apc_paid":null,"fwci":12.1211,"has_fulltext":false,"cited_by_count":284,"citation_normalized_percentile":{"value":0.99446154,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"15"},"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.9868000149726868,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9868000149726868,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.006099999882280827,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.002400000113993883,"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/shape-analysis","display_name":"shape analysis","score":0.9900000095367432},{"id":"https://openalex.org/keywords/c-programming-language","display_name":"C programming language","score":0.6759999990463257},{"id":"https://openalex.org/keywords/trees","display_name":"trees","score":0.550000011920929},{"id":"https://openalex.org/keywords/dags","display_name":"DAGs","score":0.7990000247955322},{"id":"https://openalex.org/keywords/cyclic-graphs","display_name":"cyclic graphs","score":0.972000002861023},{"id":"https://openalex.org/keywords/dependence-testing","display_name":"dependence testing","score":0.7260000109672546},{"id":"https://openalex.org/keywords/parallelization","display_name":"parallelization","score":0.9520000219345093},{"id":"https://openalex.org/keywords/interprocedural-analysis","display_name":"interprocedural analysis","score":0.8949999809265137},{"id":"https://openalex.org/keywords/context-dependence","display_name":"context sensitivity","score":0.753000020980835},{"id":"https://openalex.org/keywords/heap-analysis","display_name":"heap analysis","score":0.6209999918937683}],"concepts":[{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.9352157115936279},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7922475934028625},{"id":"https://openalex.org/C7263679","wikidata":"https://www.wikidata.org/wiki/Q5978076","display_name":"Pointer analysis","level":3,"score":0.677361249923706},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.5491932034492493},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.49574121832847595},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4616682827472687},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44841140508651733},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.43811413645744324},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41463425755500793},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3430730402469635},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.33571356534957886},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3261048197746277},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17085236310958862}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/237721.237724","doi":"https://doi.org/10.1145/237721.237724","is_oa":false,"landing_page_url":"https://doi.org/10.1145/237721.237724","pdf_url":null,"source":{"id":"https://openalex.org/S7407088133","display_name":"ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W237536699","https://openalex.org/W1493844047","https://openalex.org/W1710250545","https://openalex.org/W1970061809","https://openalex.org/W1975914482","https://openalex.org/W1980468060","https://openalex.org/W1981904441","https://openalex.org/W2002771912","https://openalex.org/W2002804719","https://openalex.org/W2004419599","https://openalex.org/W2018948086","https://openalex.org/W2025554746","https://openalex.org/W2046405656","https://openalex.org/W2047896115","https://openalex.org/W2050320220","https://openalex.org/W2077102566","https://openalex.org/W2087612811","https://openalex.org/W2097145414","https://openalex.org/W2102440514","https://openalex.org/W2111695742","https://openalex.org/W2131135493","https://openalex.org/W2135697103","https://openalex.org/W2142103345","https://openalex.org/W2151360539","https://openalex.org/W2154554979","https://openalex.org/W2161065509","https://openalex.org/W2166052260","https://openalex.org/W2912166712"],"related_works":["https://openalex.org/W1610636965","https://openalex.org/W2061874058","https://openalex.org/W7099214799","https://openalex.org/W88129876","https://openalex.org/W7098389101","https://openalex.org/W4252314084","https://openalex.org/W1992638766","https://openalex.org/W1519978886","https://openalex.org/W2142921352","https://openalex.org/W2116440917"],"abstract_inverted_index":{"This":[0,48],"paper":[1],"reports":[2],"on":[3],"the":[4,18,24,32,40,64,81,98],"design":[5],"and":[6,58,61,86,102],"implementation":[7],"of":[8,17,26,39,66,109],"a":[9,76],"practical":[10],"shape":[11,33,49],"analysis":[12,19,79,99],"for":[13,90,105],"C.":[14],"The":[15],"purpose":[16],"is":[20],"to":[21,54,62],"aid":[22],"in":[23,59,80],"disambiguation":[25],"heap-allocated":[27],"data":[28,41],"structures":[29],"by":[30],"estimating":[31],"(Tree,":[34],"DAG,":[35],"or":[36],"Cyclic":[37],"Graph)":[38],"structure":[42],"accessible":[43],"from":[44],"each":[45],"heap-directed":[46],"pointer.":[47],"information":[50],"can":[51],"be":[52],"used":[53],"improve":[55],"dependence":[56],"testing":[57],"parallelization,":[60],"guide":[63],"choice":[65],"more":[67],"complex":[68],"heap":[69],"analyses.The":[70],"method":[71],"has":[72],"been":[73],"implemented":[74],"as":[75],"context-sensitive":[77],"interprocedural":[78],"McCAT":[82],"conlpiler.":[83],"Experimental":[84],"results":[85,95,104],"observations":[87],"are":[88],"given":[89],"16":[91],"benchmark":[92],"programs.":[93],"These":[94],"show":[96],"that":[97],"gives":[100],"accurate":[101],"useful":[103],"an":[106],"important":[107],"group":[108],"applications.":[110]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":16}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
