{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:27:58Z","timestamp":1725456478340},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634409"},{"type":"electronic","value":"9783540695493"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0002729","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T12:29:42Z","timestamp":1132748982000},"page":"162-165","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A full program control flow representation for real programs"],"prefix":"10.1007","author":[{"given":"He","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Ian","family":"Watson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,26]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"D. Callahan. The program summary graph and flow-sensitive interprocedural data flow analysis. In SIGPLAN Conf. on Prog. Lang. Design and Imple. June 1988.","key":"17_CR1","DOI":"10.1145\/53990.53995"},{"key":"17_CR2","first-page":"242","volume-title":"Proceedings of the Conference on Programming Language Design and Implementation","author":"M. Emami","year":"1994","unstructured":"M. Emami and et al. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In Proceedings of the Conference on Programming Language Design and Implementation, pages 242\u2013256, New York, NY, USA, June 1994. ACM Press."},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","first-page":"522","volume-title":"Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing","author":"M. W. Hall","year":"1993","unstructured":"M. W. Hall and et al. Fiat: A framework for interprocedural analysis and transformation. In Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing, Lecture Notes in Computer Science, pages 522\u2013545, Portland, Oregon, August 12\u201314, 1993. Springer-Verlag."},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1145\/151640.151643","volume":"1","author":"M. W. Hall","year":"1992","unstructured":"Mary W. Hall and Ken Kennedy. Efficient call graph analysis. ACM Letters on Programming Languages and Systems, 1(3):227\u2013242, September 1992.","journal-title":"ACM Letters on Programming Languages and Systems"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/174662.174663","volume":"16","author":"M. J. Harrold","year":"1994","unstructured":"Mary Jean Harrold and Mary Lou Soffa. Efficient computation of interprocedural definition-use chains. ACM Transactions on Programming Languages and Systems, 16(2):175\u2013204, March 1994.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"doi-asserted-by":"crossref","unstructured":"E. Myers. A precise interprocedural data flow algorithm. In Conference Record of the Eighth annual ACM Symposium on Principles of Programming Languages, pages 219\u2013230. ACM, ACM, January 1981.","key":"17_CR6","DOI":"10.1145\/567532.567556"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-61053-7_58","volume":"1060","author":"B. Steensgaard","year":"1996","unstructured":"B. Steensgaard. Points-to analysis by type inference of programs with structures and unions. Lecture Notes in Computer Science, 1060:136-??, 1996.","journal-title":"Lecture Notes in Computer Science"},{"doi-asserted-by":"crossref","unstructured":"William E. Weihl. Interprocedural data flow analysis in the presence of pointers, procedure variables and label variables. In Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, pages 83\u201394, Las Vegas, Nevada, January 1980.","key":"17_CR8","DOI":"10.1145\/567446.567455"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'97 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0002729","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:47:57Z","timestamp":1587343677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0002729"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634409","9783540695493"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0002729","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"26 September 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}