{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T17:39:53Z","timestamp":1704994793090},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T00:00:00Z","timestamp":1117584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Higher-Order Symb Comput"],"published-print":{"date-parts":[[2005,6]]},"DOI":"10.1007\/s10990-005-7005-6","type":"journal-article","created":{"date-parts":[[2005,7,12]],"date-time":"2005-07-12T17:54:33Z","timestamp":1121190873000},"page":"15-49","source":"Crossref","is-referenced-by-count":14,"title":["Transformational Derivation of an Improved Alias Analysis Algorithm"],"prefix":"10.1007","volume":"18","author":[{"given":"Deepak","family":"Goyal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7005_CR1","volume-title":"Design and Analysis of Computer Algorithms","author":"A. Aho","year":"1974","unstructured":"Aho, A., Hopcroft, J., and Ullman, J. Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974."},{"key":"7005_CR2","unstructured":"Aho, A.V., Sethi, R., and Ullman, J.D. Compilers: Principles, Techniques, and Tools. Addison Wesley, 1988."},{"key":"7005_CR3","volume-title":"Lattice Theory","author":"G. Birkhoff","year":"1966","unstructured":"Birkhoff, G. Lattice Theory. American Mathematical Society, Providence, 1966."},{"key":"7005_CR4","unstructured":"Bloom, B. Ready simulation, bisimulation, and the semantics of CCS-like languages. PhD thesis, Massachusets Institute of Technology, 1989."},{"issue":"3","key":"7005_CR5","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/78969.78963","volume":"12","author":"M. Burke","year":"1990","unstructured":"Burke, M. An interval-based approach to exhaustive and incremental interprocedural data-flow analysis. ACM Transactions on Programming Languages and Systems, 12(3) (1990) 341\u2013395.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"7005_CR6","unstructured":"Cai, J. Fixed point computation and transformational programming. Technical Report DCS-TR-217, The State University of New Jersey, Rutgers, 1987. PhD. Thesis."},{"key":"7005_CR7","doi-asserted-by":"crossref","unstructured":"Cai, J. and Paige, R. Binding performance at language design time. In Proc. Fourteenth ACM Symp. on Principles of Programming Languages, Jan. 1987, pp. 85\u201397.","DOI":"10.1145\/41625.41633"},{"key":"7005_CR8","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0167-6423(88)90033-0","volume":"11","author":"J. Cai","year":"1988\/89","unstructured":"Cai, J. and Paige, R. Program derivation by fixed point computation. Science of Computer Programming, 11 (1988\/89) 197\u2013261.","journal-title":"Science of Computer Programming"},{"key":"7005_CR9","doi-asserted-by":"crossref","unstructured":"Chase, D.R., Wegman, M., and Zadeck, F.K. Analysis of pointers and structures. In SIGPLAN\u201990 Conference on Programming Language Design and Implementation, 1990, pp. 296\u2013310.","DOI":"10.1145\/93542.93585"},{"key":"7005_CR10","doi-asserted-by":"crossref","unstructured":"Choi, J.D., Burke, M., and Carini, P. Automatic construction of sparse data flow evaluation graphs. In 18th Annual ACM Symposium on Principles of Programming Languages, 1991, pp. 55\u201366.","DOI":"10.1145\/99583.99594"},{"key":"7005_CR11","doi-asserted-by":"crossref","unstructured":"Choi, J.D., Burke, M., and Carini, P. Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side-effects. In 20th SIGACT-SIGPLAN ACM Symposium on the Principles of Programming Languages, 1993, pp. 232\u2013245.","DOI":"10.1145\/158511.158639"},{"key":"7005_CR12","doi-asserted-by":"crossref","unstructured":"Choi, J.D. Gupta, M. Serrano, M., Sreedhar, V.C., and Midkiff, S. Escape analysis for Java. In Conference on Object-Oriented Programming Systems, Languages, and Applications, Nov. 1999.","DOI":"10.1145\/320384.320386"},{"key":"7005_CR13","unstructured":"Cousot, P. Asynchronous iterative methods for solving a fixed point system of monotone equations in a complete lattice. Res. rep. R.R. 88, Laboratoire IMAG, Universit\u00e9 scientifique et m\u00e9dicale de Grenoble, Grenoble, France, Sep. 1977. 15 p."},{"issue":"1","key":"7005_CR14","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/357062.357064","volume":"1","author":"R. Dewar","year":"1979","unstructured":"Dewar, R., Grand, A., Liu, S., and Schwartz, J. Programming by refinement, as exemplified by the SETL representation sublanguage. TOPLAS, 1(1) (1979) 27\u201349.","journal-title":"TOPLAS"},{"key":"7005_CR15","doi-asserted-by":"crossref","unstructured":"Driscoll, J.R., Sarnak, N., Sleator, D.D., and Tarjan, R.E. Making data structures persistent. Journal of Computer and System Sciences, 38(1) (1989).","DOI":"10.1016\/0022-0000(89)90034-2"},{"issue":"4","key":"7005_CR16","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0096-0551(75)90019-3","volume":"1","author":"J. Earley","year":"1976","unstructured":"Earley, J. High level iterators and a method for automatically designing data structure representation. J. of Computer Languages, 1(4) (1976) 321\u2013342.","journal-title":"J. of Computer Languages"},{"key":"7005_CR17","unstructured":"Goyal, D. A language-theoretic approach to algorithms. PhD thesis, Computer Science Department, New York University, January 2000. available at http:\/\/cs.nyu.edu\/deepak\/ThinThesis.ps."},{"key":"7005_CR18","doi-asserted-by":"crossref","unstructured":"Hind, M. Pointer analysis: Haven\u2019t we solved this problem yet? In 2001 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE\u201901), Snowbird, Utah, June 2001.","DOI":"10.1145\/379605.379665"},{"issue":"4","key":"7005_CR19","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1145\/325478.325519","volume":"21","author":"M. Hind","year":"1999","unstructured":"Hind, M., Burke, M., Carini, P., and Choi, J.D. Interprocedural pointer alias analysis. ACM TOPLAS, 21(4) (1999) 848\u2013894.","journal-title":"ACM TOPLAS"},{"key":"7005_CR20","doi-asserted-by":"crossref","unstructured":"Horwitz, S., Pfeiffer, P., and Reps, T. Dependence analysis for pointer variables. In Programming Language Design and Implementation, 1989, pp. 28\u201340.","DOI":"10.1145\/73141.74821"},{"key":"7005_CR21","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF00290339","volume":"7","author":"J.B. Kam","year":"1977","unstructured":"Kam, J.B. and Ullman, J.D. Monotone data flow analysis frameworks. Acta Informatica, 7 (1977) 305\u2013317.","journal-title":"Acta Informatica"},{"key":"7005_CR22","doi-asserted-by":"crossref","unstructured":"Kildall, G.A. A unified approach to global program optimization. In ACM Symp. on Principles of Prog. Lang., 1973, pp. 194\u2013206.","DOI":"10.1145\/512927.512945"},{"issue":"4","key":"7005_CR23","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/161494.161501","volume":"1","author":"W. Landi","year":"1992","unstructured":"Landi, W. Undecidability of static analysis. ACM Letters on Programming Languages and Systems, 1(4) (1992) 323\u2013337.","journal-title":"ACM Letters on Programming Languages and Systems"},{"key":"7005_CR24","doi-asserted-by":"crossref","unstructured":"Larus, J.R. and Hilfinger, P.N. Detecting conflicts between structure accesses. In Programming Language Design and Implementation, 1988, pp. 21\u201334.","DOI":"10.1145\/53990.53993"},{"issue":"3","key":"7005_CR25","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/0020-0190(82)90065-5","volume":"14","author":"J.-L. Lassez","year":"1982","unstructured":"Lassez, J.-L., Nguyen, V.L., and Sonenberg, L. Fixed point theorems and semantics: A folk tale. Information Processing Letters, 14(3) (1982) 112\u2013116.","journal-title":"Information Processing Letters"},{"key":"7005_CR26","unstructured":"Paige, R. Formal differentiation: A program synthesis technique. UMI Research Press, 1981. Revision of Ph.D. thesis, NYU, Jun 1979."},{"issue":"3","key":"7005_CR27","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1145\/357172.357177","volume":"4","author":"R. Paige","year":"1982","unstructured":"Paige, R. and Koenig, S. Finite differencing of computable expressions. ACM Trans. on Programming Languages and Systems, 4(3) (1982) 401\u2013454.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"issue":"1","key":"7005_CR28","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-3975(85)90159-8","volume":"40","author":"R. Paige","year":"1985","unstructured":"Paige, R., Tarjan, R., and Bonic, R. A linear time solution to the single function coarsest partition problem. Theoretical Computer Science, 40(1) (1985) 67\u201384.","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"7005_CR29","doi-asserted-by":"crossref","first-page":"1467","DOI":"10.1145\/186025.186041","volume":"16","author":"G. Ramalingam","year":"1994","unstructured":"Ramalingam, G. The undecidability of aliasing. ACM Transactions on Programming Languages and Systems, 16(6) (1994) 1467\u20131471.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"7005_CR30","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1145\/357133.357135","volume":"3","author":"E. Schonberg","year":"1981","unstructured":"Schonberg, E., Schwartz, J., and Sharir, M. An automatic technique for selection of data representations in SETL programs. ACM TOPLAS, 3(2) (1981) 126\u2013143.","journal-title":"ACM TOPLAS"},{"key":"7005_CR31","volume-title":"On Programming: An Interim Report on the SETL Project, Installments I and II","author":"J. Schwartz","year":"1974","unstructured":"Schwartz, J. On Programming: An Interim Report on the SETL Project, Installments I and II. New York University, New York, 1974."},{"key":"7005_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9575-1","volume-title":"Programming with Sets: An Introduction to SETL","author":"J. Schwartz","year":"1986","unstructured":"Schwartz, J., Dewar, R., Dubinsky, E., and Schonberg, E. Programming with Sets: An Introduction to SETL. Springer-Verlag, New York, 1986."},{"key":"7005_CR33","doi-asserted-by":"crossref","unstructured":"Steensgaard, B. Points-to analysis in almost linear time. In 23rd SIGACT-SIGPLAN ACM Symposium on the Principles of Programming Languages, 1996, pp. 32\u201341.","DOI":"10.1145\/237721.237727"},{"key":"7005_CR34","unstructured":"Suppes, P. Axiomatic Set Theory. Dover, 1972."},{"key":"7005_CR35","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 application. Pacific J. of Mathematics, 5 (1955) 285\u2013309.","journal-title":"Pacific J. of Mathematics"}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-005-7005-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-005-7005-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-005-7005-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T06:27:02Z","timestamp":1586327222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-005-7005-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2005,6]]}},"alternative-id":["7005"],"URL":"https:\/\/doi.org\/10.1007\/s10990-005-7005-6","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"value":"1388-3690","type":"print"},{"value":"1573-0557","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}