{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:01Z","timestamp":1750307941847,"version":"3.41.0"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T00:00:00Z","timestamp":1180656000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2007,6]]},"abstract":"<jats:p>Although one might expect transportation formats based on static single-assignment form (SSA) to yield faster just-in-time compilation times than those based on stack-based virtual machines, this claim has not previously been validated, in practice. We attempt to quantify the effect of using an SSA-based mobile code representation by integrating support for a verifiable SSA-based IR into Jikes RVM. Performance results, measured with various optimizations and on both the IA32 and PowerPC, show improvements in both compilation time and code quality.<\/jats:p>","DOI":"10.1145\/1250727.1250733","type":"journal-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T13:44:55Z","timestamp":1189777495000},"page":"13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["SSA-based mobile code"],"prefix":"10.1145","volume":"4","author":[{"given":"Wolfram","family":"Amme","sequence":"first","affiliation":[{"name":"Friedrich-Schiller-Universit\u00e4t Jena, Jena, Germany"}]},{"given":"Jeffery von","family":"Ronne","sequence":"additional","affiliation":[{"name":"The University of Texas at San Antonio, TX"}]},{"given":"Michael","family":"Franz","sequence":"additional","affiliation":[{"name":"University of California, Irvine, Irvine, CA"}]}],"member":"320","published-online":{"date-parts":[[2007,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73561"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.391.0211"},{"volume-title":"Effiziente und sichere Codegenerierung f\u00fcr mobilen Code. Habilitation","author":"Amme W.","key":"e_1_2_1_3_1","unstructured":"Amme , W. 2004. Effiziente und sichere Codegenerierung f\u00fcr mobilen Code. Habilitation , Friedrich-Schiller-University , Jena, Germany . Amme, W. 2004. Effiziente und sichere Codegenerierung f\u00fcr mobilen Code. Habilitation, Friedrich-Schiller-University, Jena, Germany."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378825"},{"volume-title":"Proceedings of the Second DARPA Information Survivability Conference and Exposition. IEEE Computer Society","author":"Amme W.","key":"e_1_2_1_5_1","unstructured":"Amme , W. , Dalton , N. , Fr\u00f6hlich , P. , Haldar , V. , Housel , P. S. , von Ronne , J. , Stork , C. H. , Zhenochin , S. , and Franz , M . 2001b. Project transprose: Reconciling mobile-code security with execution efficiency . In Proceedings of the Second DARPA Information Survivability Conference and Exposition. IEEE Computer Society , Los Alamitos, California. 196--210. Amme, W., Dalton, N., Fr\u00f6hlich, P., Haldar, V., Housel, P. S., von Ronne, J., Stork, C. H., Zhenochin, S., and Franz, M. 2001b. Project transprose: Reconciling mobile-code security with execution efficiency. In Proceedings of the Second DARPA Information Survivability Conference and Exposition. IEEE Computer Society, Los Alamitos, California. 196--210."},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 4th International Workshop on Compiler Optimization Meets Compiler Verification (COCV 2005)","volume":"141","author":"Amme W.","year":"2005","unstructured":"Amme , W. , von Ronne , J. , and Franz , M . 2005. Quantifying the benefits of ssa-based mobile code . In Proceedings of the 4th International Workshop on Compiler Optimization Meets Compiler Verification (COCV 2005) , April 2005 . Electronic Notes in Theoretical Computer Science Series (ENTCS) , vol. 141 . Elsevier Science, Amsterdam. 103--119. Amme, W., von Ronne, J., and Franz, M. 2005. Quantifying the benefits of ssa-based mobile code. In Proceedings of the 4th International Workshop on Compiler Optimization Meets Compiler Verification (COCV 2005), April 2005. Electronic Notes in Theoretical Computer Science Series (ENTCS), vol. 141. Elsevier Science, Amsterdam. 103--119."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/278283.278285"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/353171.353175"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/351397.351416"},{"key":"e_1_2_1_10_1","first-page":"78","article-title":"A study of replacement algorithms for virtual storage computers","volume":"5","author":"Belady L. A.","year":"1960","unstructured":"Belady , L. A. 1960 . A study of replacement algorithms for virtual storage computers . IBM Journal of Research and Development 5 , 2, 78 -- 101 . Belady, L. A. 1960. A study of replacement algorithms for virtual storage computers. IBM Journal of Research and Development 5, 2, 78--101.","journal-title":"IBM Journal of Research and Development"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90055-7"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/177492.177575"},{"key":"e_1_2_1_13_1","first-page":"6","article-title":"A benchmark suite for high performance Java. Concurrency","volume":"12","author":"Bull J. M.","year":"2000","unstructured":"Bull , J. M. , Smith , L. A. , Westhead , M. D. , Henty , D. S. , and Davey , R. A. 2000 . A benchmark suite for high performance Java. Concurrency : Practice and Experience 12 , 6 (May), 375--388. Bull, J. M., Smith, L. A., Westhead, M. D., Henty, D. S., and Davey, R. A. 2000. A benchmark suite for high performance Java. Concurrency: Practice and Experience 12, 6 (May), 375--388.","journal-title":"Practice and Experience"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/304065.304113"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/800230.806984"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2245737.2245881"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/207110.207154"},{"key":"e_1_2_1_18_1","unstructured":"Cooper K. and Torczon L. 2003. Engineering a Compiler. Morgan Kaufman San Francisco CA.   Cooper K. and Torczon L. 2003. Engineering a Compiler. Morgan Kaufman San Francisco CA."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/115372.115320"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(78)90052-5"},{"key":"e_1_2_1_21_1","unstructured":"ECMA. 2002. Common Language Infrastructure (CLI) Standard ECMA-335.  ECMA. 2002. Common Language Infrastructure (CLI) Standard ECMA-335."},{"key":"e_1_2_1_22_1","volume-title":"7th International Symposium, SAS 2000, Santa Barbara, CA, June 29--July 1, 2000, Proceedings, J. Palsberg, Ed. Lecture Notes in Computer Science","volume":"1824","author":"Fink S. J.","unstructured":"Fink , S. J. , Knobe , K. , and Sarkar , V . 2000. Unified analysis of array and object references in strongly typed languages. In Static Analysis , 7th International Symposium, SAS 2000, Santa Barbara, CA, June 29--July 1, 2000, Proceedings, J. Palsberg, Ed. Lecture Notes in Computer Science , vol. 1824 . Springer, Heidelberg. 155--174. Fink, S. J., Knobe, K., and Sarkar, V. 2000. Unified analysis of array and object references in strongly typed languages. In Static Analysis, 7th International Symposium, SAS 2000, Santa Barbara, CA, June 29--July 1, 2000, Proceedings, J. Palsberg, Ed. Lecture Notes in Computer Science, vol. 1824. Springer, Heidelberg. 155--174."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/265563.265576"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380220105"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/647475.727623"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/321832.321835"},{"key":"e_1_2_1_27_1","unstructured":"Joy B. Steele G. Gosling J. and Bracha G. 2000. Java Language Specification 2nd ed. Addison-Wesley Boston MA.   Joy B. Steele G. Gosling J. and Bracha G. 2000. Java Language Specification 2nd ed. Addison-Wesley Boston MA."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018740018601"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268956"},{"volume-title":"Proceedings of the 2004 International Symposium on Code Generation and Optimization (CGO'04)","author":"Lattner C.","key":"e_1_2_1_30_1","unstructured":"Lattner , C. and Adve , V . 2004. LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation . In Proceedings of the 2004 International Symposium on Code Generation and Optimization (CGO'04) . IEEE Computer Society, Palo Alto, CA. Lattner, C. and Adve, V. 2004. LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation. In Proceedings of the 2004 International Symposium on Code Generation and Optimization (CGO'04). IEEE Computer Society, Palo Alto, CA."},{"volume-title":"Proceedings of the World Multiconference on Systemics, Cybernetics, and Informatics. International Institute of Informatics and Systemics","author":"League C.","key":"e_1_2_1_31_1","unstructured":"League , C. , Trifonov , V. , and Shao , Z . 2001. Functional Java bytecode . In Proceedings of the World Multiconference on Systemics, Cybernetics, and Informatics. International Institute of Informatics and Systemics , Orlando, FL. League, C., Trifonov, V., and Shao, Z. 2001. Functional Java bytecode. In Proceedings of the World Multiconference on Systemics, Cybernetics, and Informatics. International Institute of Informatics and Systemics, Orlando, FL."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111072"},{"key":"e_1_2_1_33_1","unstructured":"Motwani R. Palem K. V. Sarkar V. and Reyen S. 1995. Combining register allocation and instruction scheduling. Technical Note CS-TN-95-22 (Aug.). Stanford University Department of Computer Science. Stanford CA.   Motwani R. Palem K. V. Sarkar V. and Reyen S. 1995. Combining register allocation and instruction scheduling. Technical Note CS-TN-95-22 (Aug.). Stanford University Department of Computer Science. Stanford CA."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/330249.330250"},{"key":"e_1_2_1_35_1","unstructured":"Stork C. H. 2006. WELL: A language-agnostic foundation for compact and inherently safe mobile code. Ph.D. thesis University of California Irvine CA.   Stork C. H. 2006. WELL: A language-agnostic foundation for compact and inherently safe mobile code. Ph.D. thesis University of California Irvine CA."},{"key":"e_1_2_1_36_1","volume-title":"Technical Report 00-42 (Nov.). Information and Computer Science, Univeristy of California","author":"Stork C. H.","year":"2000","unstructured":"Stork , C. H. , Haldar , V. , and Franz , M . 2000 . Generic adaptive syntax-directed compression for mobile code. Technical Report 00-42 (Nov.). Information and Computer Science, Univeristy of California , Irvine, CA . Stork, C. H., Haldar, V., and Franz, M. 2000. Generic adaptive syntax-directed compression for mobile code. Technical Report 00-42 (Nov.). Information and Computer Science, Univeristy of California, Irvine, CA."},{"key":"e_1_2_1_38_1","volume-title":"Tech. Rep. CS-TR-2006-004, Computer Science","author":"von Ronne J.","year":"2006","unstructured":"von Ronne , J. , Amme , W. , and Franz , M . 2006 . An inherently type-safe ssa-based code format. Tech. Rep. CS-TR-2006-004, Computer Science , The University of Texas at San Antonio, San Antonio . von Ronne, J., Amme, W., and Franz, M. 2006. An inherently type-safe ssa-based code format. Tech. Rep. CS-TR-2006-004, Computer Science, The University of Texas at San Antonio, San Antonio."}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250727.1250733","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1250727.1250733","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:19Z","timestamp":1750258339000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250727.1250733"}},"subtitle":["Implementation and empirical evaluation"],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["10.1145\/1250727.1250733"],"URL":"https:\/\/doi.org\/10.1145\/1250727.1250733","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"type":"print","value":"1544-3566"},{"type":"electronic","value":"1544-3973"}],"subject":[],"published":{"date-parts":[[2007,6]]},"assertion":[{"value":"2007-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}