{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:44:49Z","timestamp":1725565489155},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157684"},{"type":"electronic","value":"9783642157691"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15769-1_7","type":"book-chapter","created":{"date-parts":[[2010,9,13]],"date-time":"2010-09-13T02:09:40Z","timestamp":1284343780000},"page":"100-116","source":"Crossref","is-referenced-by-count":6,"title":["From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis"],"prefix":"10.1007","author":[{"given":"Elvira","family":"Albert","sequence":"first","affiliation":[]},{"given":"Puri","family":"Arenas","sequence":"additional","affiliation":[]},{"given":"Samir","family":"Genaim","sequence":"additional","affiliation":[]},{"given":"German","family":"Puebla","sequence":"additional","affiliation":[]},{"given":"Diana Vanessa","family":"Ram\u00edrez Deantes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","first-page":"129","volume-title":"Proc. of PDLI 2003","author":"A. Aiken","year":"2003","unstructured":"Aiken, A., Foster, J.S., Kodumal, J., Terauchi, T.: Checking and inferring local non-aliasing. In: Proc. of PDLI 2003, pp. 129\u2013140. ACM, New York (2003)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-68863-1_2","volume-title":"Formal Methods for Open Object-Based Distributed Systems","author":"E. Albert","year":"2008","unstructured":"Albert, E., Arenas, P., Codish, M., Genaim, S., Puebla, G., Zanardini, D.: Termination Analysis of Java Bytecode. In: Barthe, G., de Boer, F.S. (eds.) FMOODS 2008. LNCS, vol.\u00a05051, pp. 2\u201318. Springer, Heidelberg (2008)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-05089-3_24","volume-title":"FM 2009: Formal Methods","author":"E. Albert","year":"2009","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G.: Field-Sensitive Value Analysis by Field-Insensitive Analysis. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 370\u2013386. Springer, Heidelberg (2009)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-642-03829-7_9","volume-title":"FOSAD 2007\/2008\/2009 Tutorial Lectures","author":"E. Albert","year":"2009","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Resource usage analysis and its application to resource certification. In: FOSAD 2007. LNCS, vol.\u00a05705, pp. 258\u2013288. Springer, Heidelberg (2009)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/11817963_35","volume-title":"Computer Aided Verification","author":"J. Berdine","year":"2006","unstructured":"Berdine, J., Cook, B., Distefano, D., O\u2019Hearn, P.: Automatic termination proofs for programs with shape-shifting heaps. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 386\u2013400. Springer, Heidelberg (2006)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Cahoon, B., McKinley, K.S.: Data flow analysis for software prefetching linked data structures in Java. In: IEEE PaCT, pp. 280\u2013291 (2001)","DOI":"10.1109\/PACT.2001.953309"},{"key":"7_CR7","volume-title":"Proc. POPL","author":"P. Cousot","year":"1978","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proc. POPL. ACM, New York (1978)"},{"key":"7_CR8","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"7_CR9","series-title":"ENTCS","first-page":"35","volume-title":"Bytecode 2007","author":"H. Lehner","year":"2007","unstructured":"Lehner, H., M\u00fcller, P.: Formal translation of bytecode into BoogiePL. In: Bytecode 2007. ENTCS, pp. 35\u201350. Elsevier, Amsterdam (2007)"},{"key":"7_CR10","volume-title":"The Java Virtual Machine Specification","author":"T. Lindholm","year":"1996","unstructured":"Lindholm, T., Yellin, F.: The Java Virtual Machine Specification. Addison-Wesley, Reading (1996)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Min\u00e9, A.: Field-sensitive value analysis of embedded c programs with union types and pointer arithmetics. In: LCTES (2006)","DOI":"10.1145\/1134650.1134659"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Otto, C., Brockschmidt, M., von Essen, C., Giesl, J.: Termination Analysis of Java Bytecode by Term Rewriting. In: Waldmann, J. (ed.) International Workshop on Termination, WST 2009, Leipzig, Germany (June 2009)","DOI":"10.1007\/978-3-642-17172-7_2"},{"issue":"2&3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0743-1066(99)00031-X","volume":"41","author":"G. Puebla","year":"1999","unstructured":"Puebla, G., Hermenegildo, M.: Abstract Multiple Specialization and its Application to Program Parallelization. JLP\u00a041(2&3), 279\u2013316 (1999)","journal-title":"JLP"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/11609773_7","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S. Rossignoli","year":"2005","unstructured":"Rossignoli, S., Spoto, F.: Detecting Non-Cyclicity by Abstract Compilation into Boolean Functions. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 95\u2013110. Springer, Heidelberg (2005)"},{"key":"7_CR15","series-title":"ENTCS","volume-title":"EAAI 2006","author":"F. Spoto","year":"2006","unstructured":"Spoto, F., Hill, P., Payet, E.: Path-length analysis of object-oriented programs. In: EAAI 2006. ENTCS. Elsevier, Amsterdam (2006)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Spoto, F., Mesnard, F., Payet, \u00c9.: A Termination Analyser for Java Bytecode based on Path-Length. ACM TOPLAS (2010) (to appear)","DOI":"10.1145\/1709093.1709095"},{"key":"7_CR17","unstructured":"Vallee-Rai, R., Hendren, L., Sundaresan, V., Lam, P., Gagnon, E., Co, P.: Soot - a Java Optimization Framework. In: CASCON 1999, pp. 125\u2013135 (1999)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-03237-0_4","volume-title":"Static Analysis","author":"S. Xia","year":"2009","unstructured":"Xia, S., F\u00e4hndrich, M., Logozzo, F.: Inferring Dataflow Properties of User Defined Table Processors. In: Palsberg, J., Su, Z. (eds.) SAS 2009. LNCS, vol.\u00a05673, pp. 19\u201335. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15769-1_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:40:20Z","timestamp":1606167620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15769-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157684","9783642157691"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15769-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}