{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T10:10:02Z","timestamp":1737627002212,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403258"},{"type":"electronic","value":"9783540448983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44898-5_27","type":"book-chapter","created":{"date-parts":[[2007,11,11]],"date-time":"2007-11-11T03:21:25Z","timestamp":1194751285000},"page":"483-503","source":"Crossref","is-referenced-by-count":0,"title":["Establishing Local Temporal Heap Safety Properties with Applications to Compile-Time Memory Management"],"prefix":"10.1007","author":[{"given":"Ran","family":"Shaham","sequence":"first","affiliation":[]},{"given":"Eran","family":"Yahav","sequence":"additional","affiliation":[]},{"given":"Elliot K.","family":"Kolodner","sequence":"additional","affiliation":[]},{"given":"Mooly","family":"Sagiv","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"O. Agesen, D. Detlefs, and E. Moss. Garbage Collection and Local Variable Type-Precision and Liveness in Java Virtual Machines. In Prog. Lang. Design and Impl., June 1998.","DOI":"10.1145\/277650.277738"},{"key":"27_CR2","unstructured":"M. F. Alexander Aiken and R. Levien. Better static memory management: Improving region-based analysis of higher-order languages. In Prog. Lang. Design and Impl., June 1995."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"A. W. Appel. Compiling with Continuations, chapter 16, pages 205\u2013214. CUP, 1992.","DOI":"10.1017\/CBO9780511609619"},{"key":"27_CR4","unstructured":"T. Ball and S. Rajamani. SLIC: A Specification Language for Interface Checking (of C). Technical Report MSR-TR-2001-21, MSR, 2001."},{"issue":"7","key":"27_CR5","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1145\/359636.359713","volume":"20","author":"J. M. Barth","year":"1977","unstructured":"J. M. Barth. Shifting garbage collection overhead to compile time. Commun. ACM, 20(7):513\u2013518, 1977.","journal-title":"Commun. ACM"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"L. Birkedal, M. Tofte, and M. Vejlstrup. From region inference to von neumann machines via region representation inference. In Symp. on Princ. of Prog. Lang., pages 171\u2013183, 1996.","DOI":"10.1145\/237721.237771"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"B. Blanchet. Escape analysis for object oriented languages. application to Javatm. In Conf. on Object-Oriented Prog. Syst., Lang. and Appl., Denver, 1998.","DOI":"10.1145\/320384.320387"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"T. Colcombet and P. Fradet. Enforcing trace properties by program transformation. In Proc. of 27th POPL, pages 54\u201366, Jan. 19\u201321, 2000.","DOI":"10.1145\/325694.325703"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"J. Corbett, M. Dwyer, J. Hatcliff, C. Pasareanu, R. Shawn, and L. Hongjun. Bandera: Extracting finite-state models from Java source code. In Proc. 22nd ICSE, June 2000.","DOI":"10.1145\/337180.337234"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Symp. on Princ. of Prog. Lang., New York, NY, 1979. ACM Press.","DOI":"10.1145\/567752.567778"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"M. Das, S. Lerner, and M. Seigle. ESP: Path-sensitive program verification in polynomial time. In Prog. Lang. Design and Impl., pages 57\u201368, Berlin, June 2002.","DOI":"10.1145\/543552.512538"},{"key":"27_CR12","unstructured":"I. Foster and W. Winsborough. Copy avoidance through compile-time analysis and local reuse. In Proceedings of International Logic Programming Sympsium, pages 455\u2013469, 1991."},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"N. Hallenberg, M. Elsman, and M. Tofte. Combining region inference and garbage collection. In Prog. Lang. Design and Impl., pages 141\u2013152, Berlin, 2002.","DOI":"10.1145\/512529.512547"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"G. W. Hamilton. Compile-time garbage collection for lazy functional languages. In Memory Management, International Workshop IWMM 95, 1995.","DOI":"10.1007\/3-540-60368-9_21"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"M. Hirzel, A. Diwan, and A. L. Hosking. On the usefulness of type and liveness accuracy for garbage collection and leak detection. In Trans. on Prog. Lang. and Syst., 2002.","DOI":"10.1145\/586088.586089"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"S. Horwitz, P. Pfeiffer, and T. Reps. Dependence analysis for pointer variables. In Prog. Lang. Design and Impl., pages 28\u201340, New York, NY, 1989. ACM Press.","DOI":"10.1145\/73141.74821"},{"issue":"4","key":"27_CR17","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/48022.48025","volume":"10","author":"K. Inoue","year":"1988","unstructured":"K. Inoue, H. Seki, and H. Yagi. Analysis of functional programs to detect run-time garbage cells. Trans. on Prog. Lang. and Syst., 10(4):555\u2013578, Oct. 1988.","journal-title":"Trans. on Prog. Lang. and Syst."},{"key":"27_CR18","unstructured":"Java card 2.2 development kit. Available at java.sun.com\/products\/javacard."},{"key":"27_CR19","unstructured":"R. Jones. Garbage Collection. Algorithms for Automatic Dynamic Memory Management. John Wiley and Sons, 1999."},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"T. Lev-Ami, T. W. Reps, R. Wilhelm, and S. Sagiv. Putting static analysis to work for verification: A case study. In ISSTA, pages 26\u201338, 2000.","DOI":"10.1145\/347324.348031"},{"key":"27_CR21","unstructured":"T. Lev-Ami and M. Sagiv. TVLA: A framework for kleene based static analysis. In Static Analysis Symposium. Springer, 2000."},{"key":"27_CR22","unstructured":"S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann, 1997."},{"key":"27_CR23","unstructured":"Oberthur card systems. http:\/\/www.oberthurcs.com."},{"key":"27_CR24","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-45306-7_10","volume":"2027","author":"N. Rinetzky","year":"2001","unstructured":"N. Rinetzky and M. Sagiv. Interprocedural shape analysis for recursive programs. Lecture Notes in Computer Science, 2027:133\u2013149, 2001.","journal-title":"Lecture Notes in Computer Science"},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"J. Ross and M. Sagiv. Building a bridge between pointer aliases and program dependences. In Proceedings of the 1998 European Symposium On Programming, Mar. 1998.","DOI":"10.1007\/BFb0053573"},{"issue":"3","key":"27_CR26","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1145\/514188.514190","volume":"24","author":"M. Sagiv","year":"2002","unstructured":"M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems (TOPLAS), 24(3):217\u2013298, 2002.","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"issue":"1","key":"27_CR27","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/353323.353382","volume":"3","author":"F. Schneider","year":"2000","unstructured":"F. Schneider. Enforceable security policies. ACM Transactions on Information and System Security, 3(1):30\u201350, Feb. 2000.","journal-title":"ACM Transactions on Information and System Security"},{"key":"27_CR28","doi-asserted-by":"crossref","unstructured":"R. Shaham, E. K. Kolodner, and M. Sagiv. Automatic removal of array memory leaks in java. In Int. Conf. on Comp. Construct. Springer, Apr. 2000.","DOI":"10.1007\/3-540-46423-9_4"},{"key":"27_CR29","doi-asserted-by":"crossref","unstructured":"R. Shaham, E. K. Kolodner, and M. Sagiv. Heap profiling for space-efficient java. In Prog. Lang. Design and Impl. ACM, June 2001.","DOI":"10.1145\/378795.378820"},{"key":"27_CR30","unstructured":"R. Shaham, E. K. Kolodner, and M. Sagiv. Backward shape analysis to statically predict heap behavior. Unpublished manuscript, 2002."},{"key":"27_CR31","doi-asserted-by":"crossref","unstructured":"R. Shaham, E. K. Kolodner, and M. Sagiv. Estimating the impact of heap liveness information on space consumption in java. In Int. Symp. on Memory Management. ACM, 2002.","DOI":"10.1145\/512429.512437"},{"key":"27_CR32","doi-asserted-by":"crossref","unstructured":"M. Tofte and J.-P. Talpin. Implementation of the typed call-by-value lambda-calculus using a stack of regions. In Symp. on Princ. of Prog. Lang., pages 188\u2013201, 1996.","DOI":"10.1145\/174675.177855"},{"key":"27_CR33","unstructured":"R. Vall\u00e9e-Rai, L. Hendren, V. Sundaresan, E. G. P. Lam, and P. Co. Soot-a java optimization framework. In Proceedings of CASCON 1999, pages 125\u2013135, 1999."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44898-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T06:27:51Z","timestamp":1737527271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44898-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403258","9783540448983"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-44898-5_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}