{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T20:53:23Z","timestamp":1672260803739},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540297352","type":"print"},{"value":"9783540322474","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11575467_20","type":"book-chapter","created":{"date-parts":[[2005,11,11]],"date-time":"2005-11-11T13:58:51Z","timestamp":1131717531000},"page":"298-314","source":"Crossref","is-referenced-by-count":4,"title":["Heterogeneous Fixed Points with Application to Points-To Analysis"],"prefix":"10.1007","author":[{"given":"Aditya","family":"Kanade","sequence":"first","affiliation":[]},{"given":"Uday","family":"Khedker","sequence":"additional","affiliation":[]},{"given":"Amitabha","family":"Sanyal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/158511.158639","volume-title":"POPL 1993: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"J.-D. Choi","year":"1993","unstructured":"Choi, J.-D., Burke, M., Carini, P.: Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In: POPL 1993: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 232\u2013245. ACM Press, New York (1993)"},{"issue":"1\u20132","key":"20_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(00)00313-3","volume":"277","author":"P. Cousot","year":"2002","unstructured":"Cousot, P.: Constructive design of a hierarchy of semantics of a transition system by abstract interpretation. Theoretical Computer Science\u00a0277(1\u20132), 47\u2013103 (2002)","journal-title":"Theoretical Computer Science"},{"key":"20_CR3","unstructured":"Emami, M.: A practical interprocedural alias analysis for an optimizing\/parallelizing C compiler. Master\u2019s thesis, School of Computer Science, McGill University, Montreal (1993)"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1145\/178243.178264","volume-title":"PLDI 1994: Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation","author":"M. Emami","year":"1994","unstructured":"Emami, M., Ghiya, R., Hendren, L.J.: Context-sensitive interprocedural points-to analysis in the presence of function pointers. In: PLDI 1994: Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, pp. 242\u2013256. ACM Press, New York (1994)"},{"key":"20_CR5","first-page":"303","volume-title":"Intuitionism and Proof Theory: Proceedings of the Summer Conference at Buffalo, N.Y. Studies in Logic and the Foundations of Mathematics","author":"S. Feferman","year":"1968","unstructured":"Feferman, S.: Formal theories for transfinite iterations of generalized inductive definitions and some subsystems of analysis. In: Kino, A., Myhill, J., Vesley, R.E. (eds.) Intuitionism and Proof Theory: Proceedings of the Summer Conference at Buffalo, N.Y. Studies in Logic and the Foundations of Mathematics, pp. 303\u2013326. North-Holland, Amsterdam (1968)"},{"key":"20_CR6","first-page":"87","volume-title":"Proc. of the ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation (PEPM 2002)","author":"R. Giacobazzi","year":"2002","unstructured":"Giacobazzi, R., Mastroeni, I.: Compositionality in the puzzle of semantics. In: Proc. of the ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation (PEPM 2002), pp. 87\u201397. ACM Press, New York (2002)"},{"issue":"4","key":"20_CR7","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1145\/325478.325519","volume":"21","author":"M. Hind","year":"1999","unstructured":"Hind, M., Burke, M., Carini, P., Choi, J.-D.: Interprocedural pointer alias analysis. ACM Trans. Program. Lang. Syst.\u00a021(4), 848\u2013894 (1999)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"20_CR8","unstructured":"Hitchcock, P., Park, D.: Induction rules and termination proofs. In: Nivat, M. (ed.) Proceedings 1st Symp. on Automata, Languages, and Programming, ICALP 1972, Amsterdam, July 3\u20137, pp. 225\u2013251 (1973)"},{"key":"20_CR9","unstructured":"Kanade, A., Khedker, U., Sanyal, A.: Equivalence of may-must and definite-possibly points-to analyses. Dept. Computer Science and Engg., Indian Institute of Technology, Bombay (April 2005), \n \n http:\/\/www.cse.iitb.ac.in\/~aditya\/reports\/equivalence-points-to.ps"},{"key":"20_CR10","unstructured":"Kanade, A., Sanyal, A., Khedker, U.: Heterogeneous fixed points. Technical Report TR-CSE-001-05, Dept. Computer Science and Engg., Indian Institute of Technology, Bombay (January 2005), \n \n http:\/\/www.cse.iitb.ac.in\/~aditya\/reports\/TR-CSE-001-05.ps"},{"key":"20_CR11","volume-title":"The Compiler Design Handbook: Optimizations and Machine Code Generation","author":"U. Khedker","year":"2002","unstructured":"Khedker, U.: Data Flow Analysis. In: The Compiler Design Handbook: Optimizations and Machine Code Generation. CRC Press, Boca Raton (2002)"},{"key":"20_CR12","first-page":"194","volume-title":"Conference Record of the ACM Symposium on Principles of Programming Languages","author":"G.A. Kildall","year":"1973","unstructured":"Kildall, G.A.: A unified approach to global program optimization. In: Conference Record of the ACM Symposium on Principles of Programming Languages, October 1973, pp. 194\u2013206. Boston, Massachusetts (1973)"},{"key":"20_CR13","unstructured":"Kleene, S.C.: Introduction to Mathematics. D. Van Nostrand (1952)"},{"key":"20_CR14","first-page":"133","volume":"6","author":"B. Knaster","year":"1928","unstructured":"Knaster, B.: Une th\u00e9or\u00e8me sur les fonctions d\u2019ensembles. Annales Soc. Polonaise Math.\u00a06, 133\u2013134 (1928)","journal-title":"Annales Soc. Polonaise Math."},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/53990.53993","volume-title":"PLDI 1988: Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation","author":"J.R. Larus","year":"1988","unstructured":"Larus, J.R., Hilfinger, P.N.: Detecting conflicts between structure accesses. In: PLDI 1988: Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, pp. 24\u201331. ACM Press, New York (1988)"},{"key":"20_CR16","unstructured":"Scott, D., de Bakker, J.W.: A theory of programs. Unpublished notes, IBM seminar, Vienna (1969)"},{"key":"20_CR17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics\u00a05, 285\u2013309 (1955)","journal-title":"Pacific Journal of Mathematics"}],"container-title":["Programming Languages and Systems","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11575467_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:42:26Z","timestamp":1619505746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575467_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297352","9783540322474"],"references-count":17,"URL":"http:\/\/dx.doi.org\/10.1007\/11575467_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[2005]]}}}