{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:12:06Z","timestamp":1725549126921},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119699"},{"type":"electronic","value":"9783642119705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11970-5_17","type":"book-chapter","created":{"date-parts":[[2010,3,7]],"date-time":"2010-03-07T19:23:33Z","timestamp":1267989813000},"page":"304-323","source":"Crossref","is-referenced-by-count":3,"title":["The Hot Path SSA Form: Extending the Static Single Assignment Form for Speculative Optimizations"],"prefix":"10.1007","author":[{"given":"Subhajit","family":"Roy","sequence":"first","affiliation":[]},{"given":"Y. N.","family":"Srikant","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"17_CR1","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1145\/989393.989451","volume":"39","author":"G. Ammons","year":"2004","unstructured":"Ammons, G., Larus, J.R.: Improving data-flow analysis with path profiles. SIGPLAN Not.\u00a039(4), 568\u2013582 (2004)","journal-title":"SIGPLAN Not."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Ball, T., Larus, J.R.: Efficient path profiling. In: International Symposium on Microarchitecture (MICRO), pp. 46\u201357 (1996)","DOI":"10.1109\/MICRO.1996.566449"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Briggs, P., Cooper, K.D., Taylor Simpson, L.: Value Numbering. Software: Practice and Experience (1997)","DOI":"10.1002\/(SICI)1097-024X(199706)27:6<701::AID-SPE104>3.0.CO;2-0"},{"issue":"10","key":"17_CR4","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1109\/TPDS.2004.56","volume":"15","author":"P.-S. Chen","year":"2004","unstructured":"Chen, P.-S., Hwang, Y.-S., Ju, R.D.-C., Lee, J.K.: Interprocedural Probabilistic Pointer Analysis. IEEE Transactions on Parallel and Distributed Systems\u00a015(10), 893\u2013907 (2004)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Chow, F., Chan, S., Kennedy, R., Liu, S.-M., Lo, R., Tu, P.: A new algorithm for partial redundancy elimination based on SSA form. In: Programming Language Design and Implementation (PLDI), pp. 273\u2013286 (1997)","DOI":"10.1145\/258915.258940"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/3-540-61053-7_66","volume-title":"Compiler Construction","author":"F.C. Chow","year":"1996","unstructured":"Chow, F.C., Chan, S., Liu, S.-M., Lo, R., Streich, M.: Effective Representation of Aliases and Indirect Memory Operations in SSA Form. In: Gyim\u00f3thy, T. (ed.) CC 1996. LNCS, vol.\u00a01060, pp. 253\u2013267. Springer, Heidelberg (1996)"},{"key":"17_CR7","unstructured":"CIL - Infrastructure for C Program Analysis and Transformation, \n                    \n                      http:\/\/hal.cs.berkeley.edu\/cil\/"},{"issue":"4","key":"17_CR8","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R. Cytron","year":"1991","unstructured":"Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Kenneth Zadeck, F.: Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst.\u00a013(4), 451\u2013490 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"5","key":"17_CR9","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1145\/1168919.1168908","volume":"34","author":"J. Silva Da","year":"2006","unstructured":"Da Silva, J., Gregory Steffan, J.: A probabilistic pointer analysis for speculative optimizations. SIGARCH Comput. Archit. News\u00a034(5), 416\u2013425 (2006)","journal-title":"SIGARCH Comput. Archit. News"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Das, M., Lerner, S., Seigle, M.: ESP: path-sensitive program verification in polynomial time. In: Programming Language Design and Implementation (PLDI), pp. 57\u201368 (2002)","DOI":"10.1145\/512529.512538"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/PACT.1997.644007","volume-title":"Parallel Architectures and Compilation Techniques (PACT)","author":"R. Gupta","year":"1997","unstructured":"Gupta, R., Berson, D.A., Fang, J.Z.: Path Profile Guided Partial Dead Code Elimination Using Predication. In: Parallel Architectures and Compilation Techniques (PACT), p. 102. IEEE Computer Society, Washington, DC (1997)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Gupta, R., Berson, D.A., Fang, J.Z.: Path Profile Guided Partial Redundancy Elimination Using Speculation. In: International Conference on Computer Languages (ICCL), p. 230 (1998)","DOI":"10.1109\/ICCL.1998.674173"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Knobe, K., Sarkar, V.: Array SSA form and its use in parallelization. In: Principles of Programming Languages (POPL), pp. 107\u2013120 (1998)","DOI":"10.1145\/268946.268956"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Lin, J., Chen, T., Hsu, W.-C., Yew, P.-C., Ju, R.D.-C., Ngai, T.-F., Chan, S.: A compiler framework for speculative analysis and optimizations. In: Programming Language Design and Implementation (PLDI), pp. 289\u2013299 (2003)","DOI":"10.1145\/781131.781164"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/11860990_22","volume-title":"Modular Programming Languages","author":"R.N. Horspool","year":"2006","unstructured":"Horspool, R.N., Pereira, D.J., Scholz, B.: Fast Profile-Based Partial Redundancy Elimination. In: Lightfoot, D.E., Szyperski, C. (eds.) JMLC 2006. LNCS, vol.\u00a04228, pp. 362\u2013376. Springer, Heidelberg (2006)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Ramalingam, G.: Data flow frequency analysis. In: Programming Language Design and Implementation (PLDI), pp. 267\u2013277 (1996)","DOI":"10.1145\/231379.231433"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/CGO.2009.11","volume-title":"International Symposium on Code Generation and Optimization (CGO)","author":"S. Roy","year":"2009","unstructured":"Roy, S., Srikant, Y.N.: Profiling k-Iteration Paths: A Generalization of the Ball-Larus Profiling Algorithm. In: International Symposium on Code Generation and Optimization (CGO), pp. 70\u201380. IEEE Computer Society, Washington, DC (2009)"},{"key":"17_CR18","unstructured":"Scale: A Scalable Compiler for Analytical Experiments, \n                    \n                      http:\/\/www-ali.cs.umass.edu\/Scale\/"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Stoutchinin, A., de Ferriere, F.: Efficient static single assignment form for predication. In: International Symposium on Microarchitecture (MICRO), pp. 172\u2013181 (2001)","DOI":"10.1109\/MICRO.2001.991116"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Tallam, S., Zhang, X., Gupta, R.: Extending path profiling across loop backedges and procedure boundaries. In: International Symposium on Code Generation and Optimization (CGO), pp. 251\u2013264 (2004)","DOI":"10.1109\/CGO.2004.1281679"},{"issue":"2","key":"17_CR21","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/103135.103136","volume":"13","author":"M.N. Wegman","year":"1991","unstructured":"Wegman, M.N., Kenneth Zadeck, F.: Constant propagation with conditional branches. ACM Trans. Program. Lang. Syst.\u00a013(2), 181\u2013210 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"17_CR22","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/1138035.1138036","volume":"3","author":"J. Xue","year":"2006","unstructured":"Xue, J., Cai, Q.: A lifetime optimal algorithm for speculative PRE. ACM Trans. Archit. Code Optim.\u00a03(2), 115\u2013155 (2006)","journal-title":"ACM Trans. Archit. Code Optim."}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11970-5_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:45:58Z","timestamp":1606167958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11970-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119699","9783642119705"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11970-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}