{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:09:06Z","timestamp":1725466146260},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643029"},{"type":"electronic","value":"9783540697220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0053563","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T01:40:18Z","timestamp":1149644418000},"page":"57-74","source":"Crossref","is-referenced-by-count":9,"title":["Complexity of concrete type-inference in the presence of exceptions"],"prefix":"10.1007","author":[{"given":"Ramkrishna","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara G.","family":"Ryder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William A.","family":"Landi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,23]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Ole Agesen. The cartesian product algorithm: Simple and precise type inference of parametric polymorphism. In Proceedings of European Conference on Object-oriented Programming (ECOOP'95), 1995.","key":"5_CR1","DOI":"10.1007\/3-540-49538-X_2"},{"unstructured":"L. O. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen, 1994. Also available as DIKU report 94\/19.","key":"5_CR2"},{"issue":"9","key":"5_CR3","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1145\/359588.359596","volume":"21","author":"J. M. Barth","year":"1978","unstructured":"J. M. Barth. A practical interprocedural data flow analysis algorithm. Communications of the ACM, 21(9):724\u2013736, 1978.","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Jong-Deok Choi, Michael Burke, and Paul Carini. Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In Proceedings of the ACM SIGPLAN\/SIGACT Symposium on Principles of Programming Languages, pages 232\u2013245, January 1993.","key":"5_CR4","DOI":"10.1145\/158511.158639"},{"doi-asserted-by":"crossref","unstructured":"Ramkrishna Chatterjee, Barbara Ryder, and William Landi. Complexity of concrete type-inference in the presence of exceptions. Technical Report DCS-TR-341, Dept of CS, Rutgers University, September 1997.","key":"5_CR5","DOI":"10.1007\/BFb0053563"},{"doi-asserted-by":"crossref","unstructured":"Maryam Emami, Rakesh Ghiya, and Laurie J. Hendren. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In Proceedings of the ACM SIGPLAN Conference on Programming language design and implementation, pages 242\u2013256, 1994.","key":"5_CR6","DOI":"10.1145\/178243.178264"},{"unstructured":"James Gosling, Bill Joy, and Guy Steele. The Java Language Specification. Addison-Wesley, 1996.","key":"5_CR7"},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/321921.321938","volume":"23","author":"J.B. Kam","year":"1976","unstructured":"J.B. Kam and J.D. Ullman. Global data flow analysis and iterative algorithms. Journal of ACM, 23(1):158\u2013171, 1976.","journal-title":"Journal of ACM"},{"doi-asserted-by":"crossref","unstructured":"W.A. Landi and Barbara G. Ryder. Pointer-induced aliasing: A problem classification. In Proceedings of the ACM SIGPLAN\/SIGACT Symposium on Principles of Programming Languages, pages 93\u2013103, January 1991.","key":"5_CR9","DOI":"10.1145\/99583.99599"},{"doi-asserted-by":"crossref","unstructured":"W.A. Landi and Barbara G. Ryder. A safe approximation algorithm for interprocedural pointer aliasing. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 235\u2013248, June 1992.","key":"5_CR10","DOI":"10.1145\/143103.143137"},{"issue":"9","key":"5_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/165364.165387","volume":"28","author":"T. J. Marlowe","year":"1993","unstructured":"T. J. Marlowe, W. A. Landi, B. G. Ryder, J. Choi, M. Burke, and P. Carini. Pointer-induced aliasing: A clarification. ACM SIGPLAN Notices, 28(9):67\u201370, September 1993.","journal-title":"ACM SIGPLAN Notices"},{"unstructured":"C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.","key":"5_CR12"},{"doi-asserted-by":"crossref","unstructured":"J. Plevyak and A. Chien. Precise concrete type inference for object oriented languages. In Proceeding of Conference on Object-Oriented Programming Systems, Languages and Applications (OOPSLA'94), pages 324\u2013340, October 1994.","key":"5_CR13","DOI":"10.1145\/191080.191130"},{"doi-asserted-by":"crossref","unstructured":"Hemant Pande and Barbara G. Ryder. Data-flow-based virtual function resolution. In LNCS 1145, Proceedings of the Third International Symposium on Static Analysis, 1996.","key":"5_CR14","DOI":"10.1007\/3-540-61739-6_45"},{"doi-asserted-by":"crossref","unstructured":"J. Palsberg and M. Schwartzbach. Object-oriented type inference. In Proceedings of Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA'91), pages 146\u2013161, October 1991.","key":"5_CR15","DOI":"10.1145\/117954.117965"},{"doi-asserted-by":"crossref","unstructured":"T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Proceedings of the ACM SIGPLAN\/SIGACT Symposium on Principles of Programming Languages, pages 49\u201361, 1995.","key":"5_CR16","DOI":"10.1145\/199448.199462"},{"doi-asserted-by":"crossref","unstructured":"E. Ruf. Context-insensitive alias analysis reconsidered. In Proceedings of the ACM SIGPLAN Conference on Programming language design and implementation, pages 13\u201322, June 1995.","key":"5_CR17","DOI":"10.1145\/207110.207112"},{"doi-asserted-by":"crossref","unstructured":"M. Shapiro and S. Horwitz. Fast and accurate flow-insensitive points-to analysis. In Proceedings of the ACM SIGPLAN\/SIGACT Symposium on Principles of Programming Languages, pages 1\u201314, 1997.","key":"5_CR18","DOI":"10.1145\/263699.263703"},{"doi-asserted-by":"crossref","unstructured":"Bjarne Steensgaard. Points-to analysis in almost linear time. In Proceedings of the ACM SIGPLAN\/SIGACT Symposium on Principles of Programming Languages, pages 32\u201341, 1996.","key":"5_CR19","DOI":"10.1145\/237721.237727"},{"doi-asserted-by":"crossref","unstructured":"Robert P. Wilson and Monica S. Lam. Efficient context-sensitive pointer analysis for c programs. In Proceedings of the ACM SIGPLAN Conference on Programming language design and implementation, pages 1\u201312, 1995.","key":"5_CR20","DOI":"10.1145\/207110.207111"},{"doi-asserted-by":"crossref","unstructured":"S. Zhang, B. G. Ryder, and W. Landi. Program decomposition for pointer aliasing: A step towards practical analyses. In Proceedings of the 4th Symposium on the Foundations of Software Engineering, October 1996.","key":"5_CR21","DOI":"10.1145\/239098.239112"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0053563","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T02:34:37Z","timestamp":1555641277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0053563"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643029","9783540697220"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0053563","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}