{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:42:21Z","timestamp":1780994541835,"version":"3.54.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030206550","type":"print"},{"value":"9783030206567","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-20656-7_13","type":"book-chapter","created":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T19:02:40Z","timestamp":1559674960000},"page":"247-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Performance Exploration Through Optimistic Static Program Annotations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7870-8963","authenticated-orcid":false,"given":"Johannes","family":"Doerfert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5455-6181","authenticated-orcid":false,"given":"Brian","family":"Homerding","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7551-7122","authenticated-orcid":false,"given":"Hal","family":"Finkel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,5,17]]},"reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/MSECP.2003.1219077","volume":"1","author":"D. Ahmad","year":"2003","unstructured":"Ahmad, D.: The rising threat of vulnerabilities due to integer errors. IEEE Secur. Priv. 1(4) (2003). \n                      https:\/\/doi.org\/10.1109\/MSECP.2003.1219077","journal-title":"IEEE Security & Privacy"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Allen, J., Kennedy, K., Porterfield, C., Warren, J.: Conversion of control dependence to data dependence. In: ACM Symposium on Principles of Programming Languages, Austin, Texas, USA (1983). \n                      https:\/\/doi.org\/10.1145\/567067.567085","DOI":"10.1145\/567067.567085"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Alves, P., et al.: Runtime pointer disambiguation. In: ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA (2015). \n                      https:\/\/doi.org\/10.1145\/2814270.2814285","DOI":"10.1145\/2814270.2814285"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Ansel, J., et al.: OpenTuner: an extensible framework for program autotuning. In: International Conference on Parallel Architectures and Compilation, PACT. ACM (2014). \n                      https:\/\/doi.org\/10.1145\/2628071.2628092","DOI":"10.1145\/2628071.2628092"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Collard, J., Barthou, D., Feautrier, P.: Fuzzy array dataflow analysis. In: ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPOPP) (1995). \n                      https:\/\/doi.org\/10.1145\/209936.209947","DOI":"10.1145\/209936.209947"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Dalibard, V., Schaarschmidt, M., Yoneki, E.: BOAT: building auto-tuners with structured bayesian optimization. In: International Conference on World Wide Web, WWW. ACM (2017). \n                      https:\/\/doi.org\/10.1145\/3038912.3052662","DOI":"10.1145\/3038912.3052662"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Diwan, A., McKinley, K.S., Moss, J.E.B.: Type-based alias analysis. In: Conference on Programming Language Design and Implementation (PLDI) (1998). \n                      https:\/\/doi.org\/10.1145\/277650.277670","DOI":"10.1145\/277650.277670"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-319-98521-3_8","volume-title":"Evolving OpenMP for Evolving Architectures","author":"Johannes Doerfert","year":"2018","unstructured":"Doerfert, J., Finkel, H.: Compiler optimizations for OpenMP. In: International Workshop on OpenMP (IWOMP) (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-98521-3_8"},{"key":"13_CR9","unstructured":"Doerfert, J., Grosser, T., Hack, S.: Optimistic loop optimization. In: International Symposium on Code Generation and Optimization, CGO (2017). \n                      http:\/\/dl.acm.org\/citation.cfm?id=3049864"},{"key":"13_CR10","unstructured":"Emami, M., Ghiya, R., Hendren, L.J.: Context-sensitive interprocedural points-to analysis in the presence of function pointers. In: Conference on Programming Language Design and Implementation (PLDI) (1994). \n                      http:\/\/doi.acm.org\/10.1145\/178243.178264"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01407931","volume":"20","author":"Paul Feautrier","year":"1991","unstructured":"Feautrier, P.: Dataflow analysis of array and scalar references. Int. J. Parallel Prog. (1991). \n                      https:\/\/doi.org\/10.1007\/BF01407931","journal-title":"International Journal of Parallel Programming"},{"key":"13_CR12","unstructured":"Glek, T., Hubicka, J.: Optimizing real world applications with GCC link time optimization. CoRR (2010). \n                      http:\/\/arxiv.org\/abs\/1010.2196"},{"issue":"04","key":"13_CR13","doi-asserted-by":"publisher","first-page":"1250010","DOI":"10.1142\/S0129626412500107","volume":"22","author":"TOBIAS GROSSER","year":"2012","unstructured":"Grosser, T., Gr\u00f6\u00dflinger, A., Lengauer, C.: Polly - performing polyhedral optimizations on a low-level intermediate representation. Parallel Process. Lett. (2012). \n                      https:\/\/doi.org\/10.1142\/S0129626412500107","journal-title":"Parallel Processing Letters"},{"issue":"OOPSLA","key":"13_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3133924","volume":"1","author":"Sehun Jeong","year":"2017","unstructured":"Jeong, S., Jeon, M., Cha, S.D., Oh, H.: Data-driven context-sensitivity for points-to analysis. PACMPL (2017). \n                      https:\/\/doi.org\/10.1145\/3133924","journal-title":"Proceedings of the ACM on Programming Languages"},{"key":"13_CR15","unstructured":"Johnson, T., Amini, M., Li, D.X.: ThinLTO: scalable and incremental LTO. In: International Symposium on Code Generation and Optimization, CGO (2017). \n                      http:\/\/dl.acm.org\/citation.cfm?id=3049845"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Lattner, C., Adve, V.S.: LLVM: a compilation framework for lifelong program analysis & transformation. In: International Symposium on Code Generation and Optimization CGO (2004). \n                      https:\/\/doi.org\/10.1109\/CGO.2004.1281665","DOI":"10.1109\/CGO.2004.1281665"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Lattner, C., Lenharth, A., Adve, V.S.: Making context-sensitive points-to analysis with heap cloning practical for the real world. In: Conference on Programming Language Design and Implementation (PLDI) (2007). \n                      https:\/\/doi.org\/10.1145\/1250734.1250766","DOI":"10.1145\/1250734.1250766"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Lopes, N.P., Menendez, D., Nagarakatte, S., Regehr, J.: Provably correct peephole optimizations with alive. In: Conference on Programming Language Design and Implementation (PLDI) (2015). \n                      https:\/\/doi.org\/10.1145\/2737924.2737965","DOI":"10.1145\/2737924.2737965"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Pugh, W.: The Omega test: a fast and practical integer programming algorithm for dependence analysis. In: Conference on Supercomputing (SC) (1991). \n                      https:\/\/doi.org\/10.1145\/125826.125848","DOI":"10.1145\/125826.125848"},{"issue":"5","key":"13_CR20","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1145\/186025.186041","volume":"16","author":"G. Ramalingam","year":"1994","unstructured":"Ramalingam, G.: The undecidability of aliasing. Trans. Program. Lang. Syst. (1994). \n                      https:\/\/doi.org\/10.1145\/186025.186041","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"13_CR21","unstructured":"Sasnauskas, R., Chen, Y., Collingbourne, P., Ketema, J., Taneja, J., Regehr, J.: Souper: a synthesizing superoptimizer. CoRR (2017). \n                      http:\/\/arxiv.org\/abs\/1711.0442"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Shapiro, M., Horwitz, S.: Fast and accurate flow-insensitive points-to analysis. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) (1997). \n                      https:\/\/doi.org\/10.1145\/263699.263703","DOI":"10.1145\/263699.263703"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Steensgaard, B.: Points-to analysis in almost linear time. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) (1996). \n                      https:\/\/doi.org\/10.1145\/237721.237727","DOI":"10.1145\/237721.237727"},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Tate, R., Stepp, M., Lerner, S.: Generating compiler optimizations from proofs. In: Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Madrid, Spain, 17\u201323 January 2010, pp. 389\u2013402. ACM (2010), \n                      https:\/\/doi.org\/10.1145\/1706299.1706345","DOI":"10.1145\/1706299.1706345"},{"key":"13_CR25","doi-asserted-by":"publisher","unstructured":"Tate, R., Stepp, M., Tatlock, Z., Lerner, S.: Equality saturation: a new approach to optimization. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) (2009). \n                      https:\/\/doi.org\/10.1145\/1480881.1480915","DOI":"10.1145\/1480881.1480915"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20656-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T19:18:06Z","timestamp":1559675886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-20656-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030206550","9783030206567"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20656-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"17 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISC High Performance","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on High Performance Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Frankfurt","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"supercomputing2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.isc-hpc.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Linklings","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"70","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4-5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"n\/a","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}