{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:23:20Z","timestamp":1725456200116},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540627814"},{"type":"electronic","value":"9783540685173"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0030612","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:10:41Z","timestamp":1133417441000},"page":"381-392","source":"Crossref","is-referenced-by-count":3,"title":["On the complexity of function pointer may-alias analysis"],"prefix":"10.1007","author":[{"given":"Robert","family":"Muth","sequence":"first","affiliation":[]},{"given":"Saumya","family":"Debray","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"31_CR1","unstructured":"A. Aho, R. Sethi, and J. Ullman. Compilers. principles, techniques, and tools. Addison-Wesley, 1986."},{"issue":"4","key":"31_CR2","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1109\/32.54302","volume":"16","author":"D. Callahan","year":"1990","unstructured":"D. Callahan, A. Carle, M. Hall, and K. Kennedy. Constructing the procedure call multigraph. IEEE Trans. on Softw. Eng., 16(4):483, April 1990.","journal-title":"IEEE Trans. on Softw. Eng."},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"J. Choi, M. Burke, and P. Carini. Efficient Flow-Sensitive Interprocedural Computation of Pointer-Induced Aliases and Side Effects. Proc. 20th. ACM Symp. on Principles of Programming Languages, Jan. 1993, pp. 232\u2013245.","DOI":"10.1145\/158511.158639"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"P. Hudak and J. Young. Higher-order strictness analysis in untyped lambda calculus. In Proc. 13th ACM Symp. on Principles of Programming Languages, pages 97\u2013109, St. Petersburg Beach, Florida, January 1986.","DOI":"10.1145\/512644.512653"},{"key":"31_CR5","unstructured":"N. Jones and S. Muchnick. Complexity of flow analysis, inductive assertion synthesis, and a language due to Dijkstra. In Steven S Muchnick and Neil D Jones, editors, Program Flow Analysis: Theory and Applications, chapter 12, pages 380\u2013393. Prentice-Hall, 1981."},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"N. Jones and A. Mycroft. Data flow analysis of applicative programs using minimal function graphs: abridged version. In Proc. 13th ACM Symp. on Principles of Programming Languages, pages 296\u2013306, St. Petersburg, FL, January 1986.","DOI":"10.1145\/512644.512672"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"A. Lakhotia. Constructing call multigraphs using dependence graphs. In Proc. 20th ACM Symp. on Principles of Programming Languages, pages 273\u2013284, Charleston, South Carolina, January 1993.","DOI":"10.1145\/158511.158647"},{"issue":"7","key":"31_CR8","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1145\/143103.143137","volume":"27","author":"W. Landi","year":"1992","unstructured":"W. Landi and B. Ryder. A safe approximate algorithm for interprocedural pointer aliasing. SIGPLAN Notices, 27(7):235\u2013248, July 1992. Proc. of the ACM SIGPLAN '92 Conf. on Programming Language Design and Implementation.","journal-title":"SIGPLAN Notices"},{"issue":"6","key":"31_CR9","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/173262.155096","volume":"28","author":"W. Landi","year":"1993","unstructured":"W. Landi, B. Ryder, and S. Zhang. Interprocedural side effect analysis with pointer aliasing. SIGPLAN Notices, 28(6):56\u201367, June 1993. Proc. of the ACM SIGPLAN '93 Conf. on Programming Language Design and Implementation.","journal-title":"SIGPLAN Notices"},{"volume-title":"Technical Report 96-18","year":"1996","author":"R. Muth","key":"31_CR10","unstructured":"R. Muth and S. Debray. On the complexity of function pointer may-alias analysis. Technical Report 96-18, Dept. of Computer Science, The University of Arizona, Tucson, USA. October 1996."},{"issue":"3","key":"31_CR11","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1109\/TSE.1979.234183","volume":"SE-5","author":"B. Ryder","year":"1979","unstructured":"B. Ryder. Constructing the call graph of a program. IEEE Transaction of Software Engineering, SE-5(3):216\u2013226, 1979.","journal-title":"IEEE Transaction of Software Engineering"},{"key":"31_CR12","unstructured":"O. Shivers. Control-Flow Analysis of Higher-Order Languages or Taming Lambda. PhD thesis, Carnige-Mellon Univeristy, May 1991. Also available as CMU-CS-91-145."},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"R. Wilson and M. Lam, Efficient Context-Sensitive Pointer Analysis for C Programs. Proc. SIGPLAN '95 Conference on Programming Language Design and Implementation, June 1995, pp. 1\u201312.","DOI":"10.1145\/207110.207111"},{"key":"31_CR14","unstructured":"S. Zhang and B. Ryder. Complexity of single level function pointer aliasing analysis. Technical Report LCSR-TR-233, Laboratory of Computer Science Research, Rutgers University, October 1994."}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '97: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030612","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:20:02Z","timestamp":1586593202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030612"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540627814","9783540685173"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0030612","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}