{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:34:15Z","timestamp":1773192855968,"version":"3.50.1"},"reference-count":40,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"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":[[2005,9]]},"abstract":"<jats:p>Different types of program profiles (control flow, value, address, and dependence) have been collected and extensively studied by researchers to identify program characteristics that can then be exploited to develop more effective compilers and architectures. Because of the large amounts of profile data produced by realistic program runs, most work has focused on separately collecting and compressing different types of profiles. In this paper, we present a unified representation of profiles called Whole Execution Trace (WET), which includes the complete information contained in each of the above types of traces. Thus, WETs provide a basis for a next-generation software tool that will enable mining of program profiles to identify program characteristics that require understanding of relationships among various types of profiles. The key features of our WET representation are: WET is constructed by labeling a static program representation with profile information such that relevant and related profile information can be directly accessed by analysis algorithms as they traverse the representation; a highly effective two-tier strategy is used to significantly compress the WET; and compression techniques are designed such that they minimally affect the ability to rapidly traverse WET for extracting subsets of information corresponding to individual profile types as well as a combination of profile types. Our experimentation shows that on, an average, execution traces resulting from execution of 647 million statements can be stored in 331 megabytes of storage after compression. The compression factors range from 16 to 83. Moreover the rates at which different types of profiles can be individually or simultaneously extracted are high. We present two applications of WETs, dynamic program slicing and dynamic version matching, which make effective use of multiple kinds of profile information contained in WETs.<\/jats:p>","DOI":"10.1145\/1089008.1089012","type":"journal-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T16:00:45Z","timestamp":1131379245000},"page":"301-334","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["Whole execution traces and their applications"],"prefix":"10.1145","volume":"2","author":[{"given":"Xiangyu","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Arizona, Tucson, AZ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajiv","family":"Gupta","sequence":"additional","affiliation":[{"name":"University of Arizona, Tucson, AZ"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,9]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM","author":"Agrawal H","unstructured":"Agrawal , H and Horgan , J . 1990. Dynamic program slicing . In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM , New York, 246--256. 10.1145\/93542.93576 Agrawal, H and Horgan, J. 1990. Dynamic program slicing. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 246--256. 10.1145\/93542.93576"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380230603"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM","author":"Ammons G.","unstructured":"Ammons , G. and Larus , J. R . 1998. Improving data flow analysis with path profiles . In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM , New York, 72--84. 10.1145\/277650.277665 Ammons, G. and Larus, J. R. 1998. Improving data flow analysis with path profiles. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 72--84. 10.1145\/277650.277665"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM","author":"Ball T.","unstructured":"Ball , T. and Larus , J. R . 1996. Efficient path profiling . In Proceedings of the IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM , New York, 46--57. Ball, T. and Larus, J. R. 1996. Efficient path profiling. In Proceedings of the IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM, New York, 46--57."},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM","author":"Bodik R.","unstructured":"Bodik , R. , Gupta , R. , and Soffa , M. L . 1998. Complete removal of redundant expressions . In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM , New York, 1--14. 10.1145\/277650.277653 Bodik, R., Gupta, R., and Soffa, M. L. 1998. Complete removal of redundant expressions. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 1--14. 10.1145\/277650.277653"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the SIGMETRICS Conference. ACM","author":"Burtscher M.","year":"2004","unstructured":"Burtscher , M. 2004 . VPC3: A fast and effective trace-compression algorithm . In Proceedings of the SIGMETRICS Conference. ACM , New York, 167--176. 10.1145\/1005686.1005708 Burtscher, M. 2004. VPC3: A fast and effective trace-compression algorithm. In Proceedings of the SIGMETRICS Conference. ACM, New York, 167--176. 10.1145\/1005686.1005708"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the 12th International Conference on Parallel Architectures and Compilation Techniques. IEEE. 159--169","author":"Burtscher M.","unstructured":"Burtscher , M. and Jeeradit , M . 2003. Compressing extended program traces using value predictors . In Proceedings of the 12th International Conference on Parallel Architectures and Compilation Techniques. IEEE. 159--169 . Burtscher, M. and Jeeradit, M. 2003. Compressing extended program traces using value predictors. In Proceedings of the 12th International Conference on Parallel Architectures and Compilation Techniques. IEEE. 159--169."},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the International Conference on Parallel Architectures and Compilation Techniques. IEEE. 66--76","author":"Burtscher M.","unstructured":"Burtscher , M. and Zorn , B. G . 1999. Exploring last n value prediction . In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques. IEEE. 66--76 . Burtscher, M. and Zorn, B. G. 1999. Exploring last n value prediction. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques. IEEE. 66--76."},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 30th IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM","author":"Calder B.","unstructured":"Calder , B. , Feller , P. , and Eustace , A . 1997. Value profiling . In Proceedings of the 30th IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM , New York, 259--269. Calder, B., Feller, P., and Eustace, A. 1997. Value profiling. In Proceedings of the 30th IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM, New York, 259--269."},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM","author":"Chilimbi T. M.","year":"2001","unstructured":"Chilimbi , T. M. 2001 . Efficient representations and abstractions for quantifying and exploiting data reference locality . In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM , New York, 191--202. 10.1145\/378795.378840 Chilimbi, T. M. 2001. Efficient representations and abstractions for quantifying and exploiting data reference locality. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 191--202. 10.1145\/378795.378840"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM","author":"Chilimbi T. M.","unstructured":"Chilimbi , T. M. and Hirzel , M . 2002. Dynamic hot data stream prefetching for general-purpose programs . In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM , New York, 199--209. 10.1145\/512529.512554 Chilimbi, T. M. and Hirzel, M. 2002. Dynamic hot data stream prefetching for general-purpose programs. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 199--209. 10.1145\/512529.512554"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 2nd Irvine Software Symposium. 131--145","author":"Duesterwald E.","unstructured":"Duesterwald , E. , Gupta , R. , and Soffa , M. L . 1992. Rigorous data flow testing through output influences . In Proceedings of the 2nd Irvine Software Symposium. 131--145 . Duesterwald, E., Gupta, R., and Soffa, M. L. 1992. Rigorous data flow testing through output influences. In Proceedings of the 2nd Irvine Software Symposium. 131--145."},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the Seventh International Symposium on High Performance Computer Architecture. IEEE-CS. 207--216","author":"Goeman B.","unstructured":"Goeman , B. , Vandierendonck , H. , and Bosschere , K . 2001. Differential FCM: increasing value prediction accuracy by improving table usage efficiency . In Proceedings of the Seventh International Symposium on High Performance Computer Architecture. IEEE-CS. 207--216 . Goeman, B., Vandierendonck, H., and Bosschere, K. 2001. Differential FCM: increasing value prediction accuracy by improving table usage efficiency. In Proceedings of the Seventh International Symposium on High Performance Computer Architecture. IEEE-CS. 207--216."},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 16th IEEE International Conference on Automated Software Engineering. IEEE. 144--153","author":"Gupta N.","unstructured":"Gupta , N. and Rao , P . 2001. Program execution based module cohesion measurement . In Proceedings of the 16th IEEE International Conference on Automated Software Engineering. IEEE. 144--153 . Gupta, N. and Rao, P. 2001. Program execution based module cohesion measurement. In Proceedings of the 16th IEEE International Conference on Automated Software Engineering. IEEE. 144--153."},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the IEEE International Conference on Computer Languages. IEEE. 230--239","author":"Gupta R.","unstructured":"Gupta , R. , Berson , D. , and Fang , J. Z . 1998. Path profile guided partial redundancy elimination using speculation . In Proceedings of the IEEE International Conference on Computer Languages. IEEE. 230--239 . Gupta, R., Berson, D., and Fang, J. Z. 1998. Path profile guided partial redundancy elimination using speculation. In Proceedings of the IEEE International Conference on Computer Languages. IEEE. 230--239."},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 30th IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM","author":"Jacobson Q.","unstructured":"Jacobson , Q. , Rotenberg , E. , and Smith , J. E . 1997. Path-based next trace prediction . In Proceedings of the 30th IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM , New York, 14--23. Jacobson, Q., Rotenberg, E., and Smith, J. E. 1997. Path-based next trace prediction. In Proceedings of the 30th IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM, New York, 14--23."},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the ACM SIGSOFT 7th Symposium on Foundations of Software Engineering and 8th European Software Engineering Conference. LNCS 1687","author":"Jaramillo C.","unstructured":"Jaramillo , C. , Gupta , R. , and Soffa , M. L . 1999. Comparison checking: an approach to avoid debugging of optimized code . In Proceedings of the ACM SIGSOFT 7th Symposium on Foundations of Software Engineering and 8th European Software Engineering Conference. LNCS 1687 , Springer Verlag, New York, 268--284. Jaramillo, C., Gupta, R., and Soffa, M. L. 1999. Comparison checking: an approach to avoid debugging of optimized code. In Proceedings of the ACM SIGSOFT 7th Symposium on Foundations of Software Engineering and 8th European Software Engineering Conference. LNCS 1687, Springer Verlag, New York, 268--284."},{"key":"e_1_2_1_18_1","volume-title":"Proccedings of the International Symposium on Computer Architecture. IEEE\/ACM","author":"Joseph D.","unstructured":"Joseph , D. and Grunwald , D . 1997. Prefetching using Markov predictors . In Proccedings of the International Symposium on Computer Architecture. IEEE\/ACM , New York, 252--263. 10.1145\/264107.264207 Joseph, D. and Grunwald, D. 1997. Prefetching using Markov predictors. In Proccedings of the International Symposium on Computer Architecture. IEEE\/ACM, New York, 252--263. 10.1145\/264107.264207"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"KleinOsowski A. J. and Lilja D. J. 2002. MinneSPEC: a new SPEC benchmark workload for simulation-based computer architecture research. Computer Architecture Letters 1. 10.1109\/L-CA.2002.8   KleinOsowski A. J. and Lilja D. J. 2002. MinneSPEC: a new SPEC benchmark workload for simulation-based computer architecture research. Computer Architecture Letters 1. 10.1109\/L-CA.2002.8","DOI":"10.1109\/L-CA.2002.8"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90054-3"},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the Automated and Algorithmic Debugging. 43--59","author":"Korel B.","unstructured":"Korel , B. and Rilling , J . 1997. Application of dynamic slicing in program debugging . In Proceedings of the Automated and Algorithmic Debugging. 43--59 . Korel, B. and Rilling, J. 1997. Application of dynamic slicing in program debugging. In Proceedings of the Automated and Algorithmic Debugging. 43--59."},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM","author":"Larus J. R.","year":"1999","unstructured":"Larus , J. R. 1999 . Whole program paths . In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM , New York, 259--269. 10.1145\/301618.301678 Larus, J. R. 1999. Whole program paths. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 259--269. 10.1145\/301618.301678"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 29th IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM","author":"Lipasti M. H.","unstructured":"Lipasti , M. H. and Shen , J. P . 1996. Exceeding the dataflow limit via value prediction . In Proceedings of the 29th IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM , New York, 226--237. Lipasti, M. H. and Shen, J. P. 1996. Exceeding the dataflow limit via value prediction. In Proceedings of the 29th IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM, New York, 226--237."},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the Data Compression Conference. IEEE-CS. 3--11","author":"Nevil-Manning C. G.","unstructured":"Nevil-Manning , C. G. and Witten , I. H . 1997. Linear-time, incremental hierarchy inference for compression . In Proceedings of the Data Compression Conference. IEEE-CS. 3--11 . Nevil-Manning, C. G. and Witten, I. H. 1997. Linear-time, incremental hierarchy inference for compression. In Proceedings of the Data Compression Conference. IEEE-CS. 3--11."},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the SIGMETRICS the International Conference on Measurement and Modeling of Computer Systems. ACM","author":"Perelman E.","unstructured":"Perelman , E. , Hamerly , G. , Biesbrouck , M. V. , Sherwood , T. , and Calder , B . 2003. Using SimPoint for accurate and efficient simulation . In Proceedings of the SIGMETRICS the International Conference on Measurement and Modeling of Computer Systems. ACM , New York, 318--319. 10.1145\/781027.781076 Perelman, E., Hamerly, G., Biesbrouck, M. V., Sherwood, T., and Calder, B. 2003. Using SimPoint for accurate and efficient simulation. In Proceedings of the SIGMETRICS the International Conference on Measurement and Modeling of Computer Systems. ACM, New York, 318--319. 10.1145\/781027.781076"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM","author":"Rubin S.","unstructured":"Rubin , S. , Bodik , R. , and Chilimbi , T . 2002. An efficient profile-analysis framework for data layout optimizations . In Proceedings of the 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM , New York, 140--153. 10.1145\/503272.503287 Rubin, S., Bodik, R., and Chilimbi, T. 2002. An efficient profile-analysis framework for data layout optimizations. In Proceedings of the 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, 140--153. 10.1145\/503272.503287"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the Value Prediction Workshop.","author":"Sazeides Y.","year":"2003","unstructured":"Sazeides , Y. 2003 . Instruction-isomorphism in program execution . In Proceedings of the Value Prediction Workshop. Sazeides, Y. 2003. Instruction-isomorphism in program execution. In Proceedings of the Value Prediction Workshop."},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the 30th IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM","author":"Sazeides Y.","unstructured":"Sazeides , Y. and Smith , J. E . 1997a. The predictability of data values . In Proceedings of the 30th IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM , New York, 248--258. Sazeides, Y. and Smith, J. E. 1997a. The predictability of data values. In Proceedings of the 30th IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM, New York, 248--258."},{"key":"e_1_2_1_30_1","volume-title":"Technical Report ECE-97-8, University of Wisconsin-Madison.","author":"Sazeides Y.","year":"1997","unstructured":"Sazeides , Y. and Smith , J. E . 1997 b. Implementations of context based value predictors. Technical Report ECE-97-8, University of Wisconsin-Madison. Sazeides, Y. and Smith, J. E. 1997b. Implementations of context based value predictors. Technical Report ECE-97-8, University of Wisconsin-Madison."},{"key":"e_1_2_1_31_1","unstructured":"Trimaran Compiler Research Infrastructure 1997. Tutorial Notes.  Trimaran Compiler Research Infrastructure 1997. Tutorial Notes."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/201059.201062"},{"key":"e_1_2_1_33_1","first-page":"352","article-title":"Program slicing","volume":"4","author":"Weiser M.","year":"1982","unstructured":"Weiser , M. 1982 . Program slicing . IEEE Transactions on Software Engineering SE-10 , 4 , 352 -- 357 . Weiser, M. 1982. Program slicing. IEEE Transactions on Software Engineering SE-10, 4, 352--357.","journal-title":"IEEE Transactions on Software Engineering SE-10"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/581888.581894"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM","author":"Young C.","unstructured":"Young , C. and Smith , M. D . 1998. Better global scheduling using path profiles . In Proceedings of the IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM , New York, 115--123. Young, C. and Smith, M. D. 1998. Better global scheduling using path profiles. In Proceedings of the IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM, New York, 115--123."},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM","author":"Zhang Y.","unstructured":"Zhang , Y. and Gupta , R . 2001. Timestamped whole program path representation and its applications . In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM , New York, 180--190. 10.1145\/378795.378835 Zhang, Y. and Gupta, R. 2001. Timestamped whole program path representation and its applications. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 180--190. 10.1145\/378795.378835"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the International Conference on Compiler Construction. LNCS 2304","author":"Zhang Y.","unstructured":"Zhang , Y. and Gupta , R . 2002. Data compression transformations for dynamically allocated data structures . In Proceedings of the International Conference on Compiler Construction. LNCS 2304 , Springer Verlag, New York, 14--28. Zhang, Y. and Gupta, R. 2002. Data compression transformations for dynamically allocated data structures. In Proceedings of the International Conference on Compiler Construction. LNCS 2304, Springer Verlag, New York, 14--28."},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of the IEEE\/ACM International Conference on Software Engineering. IEEE\/ACM","author":"Zhang X.","unstructured":"Zhang , X. , Gupta , R. , and Zhang , Y . 2003. Precise dynamic slicing algorithms . In Proceedings of the IEEE\/ACM International Conference on Software Engineering. IEEE\/ACM , New York, 319--329. Zhang, X., Gupta, R., and Zhang, Y. 2003. Precise dynamic slicing algorithms. In Proceedings of the IEEE\/ACM International Conference on Software Engineering. IEEE\/ACM, New York, 319--329."},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM","author":"Zhang X.","unstructured":"Zhang , X. and Gupta , R . 2004. Cost effective dynamic program slicing . In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM , New York, 94--106. 10.1145\/996841.996855 Zhang, X. and Gupta, R. 2004. Cost effective dynamic program slicing. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 94--106. 10.1145\/996841.996855"},{"key":"e_1_2_1_40_1","volume-title":"Proceedings of the Joint 10th European Software Engineering Conference and 13th SIGSOFT Symposium on the Foundations of Software Engineering. ACM","author":"Zhang X.","unstructured":"Zhang , X. and Gupta , R . 2005. Matching execution histories of program versions . In Proceedings of the Joint 10th European Software Engineering Conference and 13th SIGSOFT Symposium on the Foundations of Software Engineering. ACM , to appear. 189--206. 10.1145\/1081706.1081738 Zhang, X. and Gupta, R. 2005. Matching execution histories of program versions. In Proceedings of the Joint 10th European Software Engineering Conference and 13th SIGSOFT Symposium on the Foundations of Software Engineering. ACM, to appear. 189--206. 10.1145\/1081706.1081738"},{"key":"e_1_2_1_41_1","volume-title":"Proceedings of the IEEE\/ACM 27th International Symposium on Computer Architecture. IEEE\/ACM","author":"Zilles C. B.","unstructured":"Zilles , C. B. and Sohi , G . 2000. Understanding the backward slices of performance degrading instructions . In Proceedings of the IEEE\/ACM 27th International Symposium on Computer Architecture. IEEE\/ACM , New York, 172--181. 10.1145\/339647.339676 Zilles, C. B. and Sohi, G. 2000. Understanding the backward slices of performance degrading instructions. In Proceedings of the IEEE\/ACM 27th International Symposium on Computer Architecture. IEEE\/ACM, New York, 172--181. 10.1145\/339647.339676"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1089008.1089012","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1089008.1089012","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:21Z","timestamp":1750262901000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1089008.1089012"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["10.1145\/1089008.1089012"],"URL":"https:\/\/doi.org\/10.1145\/1089008.1089012","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9]]},"assertion":[{"value":"2005-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}