Identifying DEF/USE information of statements that construct and traverse dynamic recursive data structures
Pointer analysis is essential for optimizing and parallelizing compilers. It examines pointer assignment statements and estimates pointer-induced aliases among pointer variables or possible shapes of dynamic recursive data structures. However, previously proposed techniques perform pointer analysis...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 145 |
|---|---|
| container_issue | |
| container_start_page | 131 |
| container_title | |
| container_volume | |
| creator | Hwang, Yuan-Shin Saltz, Joel |
| description | Pointer analysis is essential for optimizing and parallelizing compilers. It examines pointer assignment statements and estimates pointer-induced aliases among pointer variables or possible shapes of dynamic recursive data structures. However, previously proposed techniques perform pointer analysis without the knowledge of traversal patterns of dynamic recursive data structures to be constructed. This paper presents an algorithm to identify the traversal patterns of recursive data structures and propagate this information back to those statements that define the data structures. This approach recognizes the DEF/USE relationships between the statements that define and traverse dynamic recursive data structures. The outcome of this technique will be useful for pointer analysis and parallelization. Algorithms to perform pointer analysis and dependence test using the knowledge of traversal patterns will also be presented. |
| doi_str_mv | 10.1007/BFb0032688 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_2043361</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2043361</sourcerecordid><originalsourceid>FETCH-LOGICAL-p1328-21979abaa85940a7a332d48509d4095b1880c92e91ae9bee9397eceda0f920723</originalsourceid><addsrcrecordid>eNpFkL1OwzAYRc2fRCldeAIPDCyhn3-S2COUFipVYoDO0ZfEKaaNU9lupb49KUViutK5R3e4hNwxeGQA-fh5VgIInil1Rm5EKiHTuVLqnAxYxlgihNQXZNSz307KnOtLMgABPNG5FNdkFMI3wHFDCkgHZD2vjYu2OVi3oi_T2Xj5MaXWNZ1vMdrO0a6hIWI0ba8FGr8w0qpzIfpdFSm6mkaPe-ODofXBYWsr6k2188Hue4IR6UndeRNuyVWDm2BGfzkky9n0c_KWLN5f55OnRbJlgquEM51rLBFVqiVgjkLwWqoUdC1BpyVTCirNjWZodGmMFjo3lakRGs0h52JI7k-7WwwVbhqPrrKh2Hrboj8UHKQQGeu1h5MW-satjC_KrluHgkFx_Lr4_1r8ALhHbQM</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Identifying DEF/USE information of statements that construct and traverse dynamic recursive data structures</title><source>Springer Books</source><creator>Hwang, Yuan-Shin ; Saltz, Joel</creator><contributor>Chatterjee, Siddharta ; Sadayappan, P. ; Li, Zhiyuan ; Sehr, David ; Huang, Chua-Huang ; Yew, Pen-Chung</contributor><creatorcontrib>Hwang, Yuan-Shin ; Saltz, Joel ; Chatterjee, Siddharta ; Sadayappan, P. ; Li, Zhiyuan ; Sehr, David ; Huang, Chua-Huang ; Yew, Pen-Chung</creatorcontrib><description>Pointer analysis is essential for optimizing and parallelizing compilers. It examines pointer assignment statements and estimates pointer-induced aliases among pointer variables or possible shapes of dynamic recursive data structures. However, previously proposed techniques perform pointer analysis without the knowledge of traversal patterns of dynamic recursive data structures to be constructed. This paper presents an algorithm to identify the traversal patterns of recursive data structures and propagate this information back to those statements that define the data structures. This approach recognizes the DEF/USE relationships between the statements that define and traverse dynamic recursive data structures. The outcome of this technique will be useful for pointer analysis and parallelization. Algorithms to perform pointer analysis and dependence test using the knowledge of traversal patterns will also be presented.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540644729</identifier><identifier>ISBN: 3540644725</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540697888</identifier><identifier>EISBN: 9783540697886</identifier><identifier>DOI: 10.1007/BFb0032688</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Assignment Statement ; Basic Block ; Computer science; control theory; systems ; Data processing. List processing. Character string processing ; Dependence Test ; Exact sciences and technology ; Memory organisation. Data processing ; Path Expression ; Pointer Analysis ; Software</subject><ispartof>Languages and Compilers for Parallel Computing, 2005, p.131-145</ispartof><rights>Springer-Verlag Berlin Heidelberg 1998</rights><rights>1998 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/BFb0032688$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/BFb0032688$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,776,777,781,786,787,790,4036,4037,27906,38236,41423,42492</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2043361$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Chatterjee, Siddharta</contributor><contributor>Sadayappan, P.</contributor><contributor>Li, Zhiyuan</contributor><contributor>Sehr, David</contributor><contributor>Huang, Chua-Huang</contributor><contributor>Yew, Pen-Chung</contributor><creatorcontrib>Hwang, Yuan-Shin</creatorcontrib><creatorcontrib>Saltz, Joel</creatorcontrib><title>Identifying DEF/USE information of statements that construct and traverse dynamic recursive data structures</title><title>Languages and Compilers for Parallel Computing</title><description>Pointer analysis is essential for optimizing and parallelizing compilers. It examines pointer assignment statements and estimates pointer-induced aliases among pointer variables or possible shapes of dynamic recursive data structures. However, previously proposed techniques perform pointer analysis without the knowledge of traversal patterns of dynamic recursive data structures to be constructed. This paper presents an algorithm to identify the traversal patterns of recursive data structures and propagate this information back to those statements that define the data structures. This approach recognizes the DEF/USE relationships between the statements that define and traverse dynamic recursive data structures. The outcome of this technique will be useful for pointer analysis and parallelization. Algorithms to perform pointer analysis and dependence test using the knowledge of traversal patterns will also be presented.</description><subject>Applied sciences</subject><subject>Assignment Statement</subject><subject>Basic Block</subject><subject>Computer science; control theory; systems</subject><subject>Data processing. List processing. Character string processing</subject><subject>Dependence Test</subject><subject>Exact sciences and technology</subject><subject>Memory organisation. Data processing</subject><subject>Path Expression</subject><subject>Pointer Analysis</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540644729</isbn><isbn>3540644725</isbn><isbn>3540697888</isbn><isbn>9783540697886</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpFkL1OwzAYRc2fRCldeAIPDCyhn3-S2COUFipVYoDO0ZfEKaaNU9lupb49KUViutK5R3e4hNwxeGQA-fh5VgIInil1Rm5EKiHTuVLqnAxYxlgihNQXZNSz307KnOtLMgABPNG5FNdkFMI3wHFDCkgHZD2vjYu2OVi3oi_T2Xj5MaXWNZ1vMdrO0a6hIWI0ba8FGr8w0qpzIfpdFSm6mkaPe-ODofXBYWsr6k2188Hue4IR6UndeRNuyVWDm2BGfzkky9n0c_KWLN5f55OnRbJlgquEM51rLBFVqiVgjkLwWqoUdC1BpyVTCirNjWZodGmMFjo3lakRGs0h52JI7k-7WwwVbhqPrrKh2Hrboj8UHKQQGeu1h5MW-satjC_KrluHgkFx_Lr4_1r8ALhHbQM</recordid><startdate>20050609</startdate><enddate>20050609</enddate><creator>Hwang, Yuan-Shin</creator><creator>Saltz, Joel</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>20050609</creationdate><title>Identifying DEF/USE information of statements that construct and traverse dynamic recursive data structures</title><author>Hwang, Yuan-Shin ; Saltz, Joel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p1328-21979abaa85940a7a332d48509d4095b1880c92e91ae9bee9397eceda0f920723</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Assignment Statement</topic><topic>Basic Block</topic><topic>Computer science; control theory; systems</topic><topic>Data processing. List processing. Character string processing</topic><topic>Dependence Test</topic><topic>Exact sciences and technology</topic><topic>Memory organisation. Data processing</topic><topic>Path Expression</topic><topic>Pointer Analysis</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hwang, Yuan-Shin</creatorcontrib><creatorcontrib>Saltz, Joel</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hwang, Yuan-Shin</au><au>Saltz, Joel</au><au>Chatterjee, Siddharta</au><au>Sadayappan, P.</au><au>Li, Zhiyuan</au><au>Sehr, David</au><au>Huang, Chua-Huang</au><au>Yew, Pen-Chung</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Identifying DEF/USE information of statements that construct and traverse dynamic recursive data structures</atitle><btitle>Languages and Compilers for Parallel Computing</btitle><date>2005-06-09</date><risdate>2005</risdate><spage>131</spage><epage>145</epage><pages>131-145</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540644729</isbn><isbn>3540644725</isbn><eisbn>3540697888</eisbn><eisbn>9783540697886</eisbn><abstract>Pointer analysis is essential for optimizing and parallelizing compilers. It examines pointer assignment statements and estimates pointer-induced aliases among pointer variables or possible shapes of dynamic recursive data structures. However, previously proposed techniques perform pointer analysis without the knowledge of traversal patterns of dynamic recursive data structures to be constructed. This paper presents an algorithm to identify the traversal patterns of recursive data structures and propagate this information back to those statements that define the data structures. This approach recognizes the DEF/USE relationships between the statements that define and traverse dynamic recursive data structures. The outcome of this technique will be useful for pointer analysis and parallelization. Algorithms to perform pointer analysis and dependence test using the knowledge of traversal patterns will also be presented.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/BFb0032688</doi><tpages>15</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Languages and Compilers for Parallel Computing, 2005, p.131-145 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_2043361 |
| source | Springer Books |
| subjects | Applied sciences Assignment Statement Basic Block Computer science control theory systems Data processing. List processing. Character string processing Dependence Test Exact sciences and technology Memory organisation. Data processing Path Expression Pointer Analysis Software |
| title | Identifying DEF/USE information of statements that construct and traverse dynamic recursive data structures |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T18%3A51%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Identifying%20DEF/USE%20information%20of%20statements%20that%20construct%20and%20traverse%20dynamic%20recursive%20data%20structures&rft.btitle=Languages%20and%20Compilers%20for%20Parallel%20Computing&rft.au=Hwang,%20Yuan-Shin&rft.date=2005-06-09&rft.spage=131&rft.epage=145&rft.pages=131-145&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540644729&rft.isbn_list=3540644725&rft_id=info:doi/10.1007/BFb0032688&rft_dat=%3Cpascalfrancis_sprin%3E2043361%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540697888&rft.eisbn_list=9783540697886&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |