{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:40:41Z","timestamp":1725493241989},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418610"},{"type":"electronic","value":"9783540453062"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45306-7_4","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T22:55:18Z","timestamp":1193525718000},"page":"37-51","source":"Crossref","is-referenced-by-count":4,"title":["A Novel Probabilistic Data Flow Framework"],"prefix":"10.1007","author":[{"given":"Eduard","family":"Mehofer","sequence":"first","affiliation":[]},{"given":"Bernhard","family":"Scholz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/360018.360025","volume":"19","author":"F. E. Allen","year":"1976","unstructured":"F. E. Allen and J. Cocke. A program data flow analysis procedure. Communications of the ACM, 19(3):137\u2013147, March 1976.","journal-title":"Communications of the ACM"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"G. Ammons and J.R. Larus. Improving data-flow analysis with path profiles. In Proc. of the ACM SIGPLAN\u2019 98 Conference on Programming Language Design and Implementation (PLDI\u201998), pages 72\u201384, Montreal, Canada, June 1998.","DOI":"10.1145\/277650.277665"},{"issue":"5","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/277652.277653","volume":"33","author":"R. Bod\u00edk","year":"1998","unstructured":"R. Bod\u00edk, R. Gupta, and M.L. Soffa. Complete removal of redundant expressions. ACM SIGPLAN Notices, 33(5):1\u201314, May 1998.","journal-title":"ACM SIGPLAN Notices"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"A.L. Buchsbaum, H. Kaplan, A. Rogers, and J.R. Westbrook. Linear-time pointer-machine algorithms for LCAs, MST verification, and dominators. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), pages 279\u2013288, New York, May 23\u201326 1998. ACM Press.","DOI":"10.1145\/276698.276764"},{"issue":"11","key":"4_CR5","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1145\/195470.195553","volume":"29","author":"B. Calder","year":"1994","unstructured":"B. Calder and D. Grunwald. Reducing branch costs via branch alignment. ACM SIGPLAN Notices, 29(11):242\u2013251, November 1994.","journal-title":"ACM SIGPLAN Notices"},{"issue":"7","key":"4_CR6","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1109\/TC.1981.1675827","volume":"C-30","author":"J. A. Fisher","year":"1981","unstructured":"J. A. Fisher. Trace scheduling: A technique for global microcode compaction. IEEE Trans. Comput., C-30(7):478\u2013490, 1981.","journal-title":"IEEE Trans. Comput."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"R. Gupta, D. Berson, and J.Z. Fang. Path profile guided partial dead code elimination using predication. In International Conference on Parallel Architectures and Compilation Techniques (PACT\u201997), pages 102\u2013115, San Francisco, California, November 1997.","DOI":"10.1109\/PACT.1997.644007"},{"key":"4_CR8","unstructured":"M.S. Hecht. Flow Analysis of Computer Programs. Programming Language Series. North-Holland, 1977."},{"issue":"7","key":"4_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/351397.351418","volume":"35","author":"E. Mehofer","year":"2000","unstructured":"E. Mehofer and B. Scholz. Probabilistic data flow system with two-edge profiling. Workshop on Dynamic and Adaptive Compilation and Optimization (Dynamo\u201900). ACM SIGPLAN Notices, 35(7):65\u201372, July 2000.","journal-title":"Workshop on Dynamic and Adaptive Compilation and Optimization (Dynamo\u201900)"},{"key":"4_CR10","unstructured":"E. Mehofer and B. Scholz. Probabilistic procedure cloning for high-performance systems. In 12th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD\u20192000), Sao Pedro, Brazil, October 2000."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"E. Mehofer and B. Scholz. Probabilistic communication optimizations and parallelization for distributed-memory systems. In PDP 2001, Mantova, Italy, February 2001.","DOI":"10.1109\/EMPDP.2001.905042"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"T. C. Mowry and C.-K. Luk. Predicting data cache misses in non-numeric applications through correlation profiling. In Proceedings of the 30th Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO-97), pages 314\u2013320, Los Alamitos, December 1\u20133 1997. IEEE Computer Society.","DOI":"10.1109\/MICRO.1997.645827"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"G. Ramalingam. Data flow frequency analysis. In Proc. of the ACM SIGPLAN\u2019 96 Conference on Programming Language Design and Implementation (PLDI\u201996), pages 267\u2013277, Philadephia, Pennsylvania, May 1996.","DOI":"10.1145\/231379.231433"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Proc. of the ACM Symposium on Principles of Programming Languages (POPL\u201995), pages 49\u201361, San Francisco, CA, January 1995.","DOI":"10.1145\/199448.199462"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/27632.27649","volume":"18","author":"B. G. Ryder","year":"1986","unstructured":"B. G. Ryder and M. C. Paull. Elimination algorithms for data flow analysis. ACM Computing Surveys, 18(3):277\u2013315, September 1986.","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1145\/276393.278523","volume":"20","author":"V. C. Sreedhar","year":"1998","unstructured":"V. C. Sreedhar, G. R. Gao, and Y.-F. Lee. A new framework for elimination-based data flow analysis using DJ graphs. ACM Transactions on Programming Languages and Systems, 20(2):388\u2013435, March 1998.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"4_CR17","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1145\/322261.322273","volume":"28","author":"R. E. Tarjan","year":"1981","unstructured":"R. E. Tarjan. Fast algorithms for solving path problems. Journal of the ACM, 28(3):594\u2013614, July 1981.","journal-title":"Journal of the ACM"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"C. Young and M. D. Smith. Better global scheduling using path profiles. In Proceedings of the 31st Annual ACM\/IEEE International Symposium on Microarchitecture (MICRO-98), pages 115\u2013126, Los Alamitos, November 30-December 2 1998. IEEE Computer Society.","DOI":"10.1109\/MICRO.1998.742774"},{"issue":"5","key":"4_CR19","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1145\/330249.330255","volume":"21","author":"C. Young","year":"1999","unstructured":"C. Young and M.D. Smith. Static correlated branch prediction. ACM Transactions on Programming Languages and Systems, 21(5):1028\u20131075, September 1999.","journal-title":"ACM Transactions on Programming Languages and Systems"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45306-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:19:27Z","timestamp":1556936367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45306-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418610","9783540453062"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45306-7_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}