{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T09:54:29Z","timestamp":1780998869134,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T00:00:00Z","timestamp":1559952000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["678880"],"award-info":[{"award-number":["678880"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","award":["PZ00P2168016"],"award-info":[{"award-number":["PZ00P2168016"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,8]]},"DOI":"10.1145\/3314221.3314606","type":"proceedings-article","created":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T21:02:18Z","timestamp":1559941338000},"page":"816-829","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["A fast analytical model of fully associative caches"],"prefix":"10.1145","author":[{"given":"Tobias","family":"Gysi","sequence":"first","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tobias","family":"Grosser","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laurin","family":"Brandner","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Torsten","family":"Hoefler","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/63404.63407"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158120"},{"key":"e_1_3_2_2_3_1","volume-title":"USENIX Annual Technical Conference, FREENIX Track","volume":"41","author":"Bellard Fabrice","year":"2005","unstructured":"Fabrice Bellard . 2005 . QEMU, a fast and portable dynamic translator .. In USENIX Annual Technical Conference, FREENIX Track , Vol. 41 . 46. Fabrice Bellard. 2005. QEMU, a fast and portable dynamic translator.. In USENIX Annual Technical Conference, FREENIX Track, Vol. 41. 46."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.194.0353"},{"key":"e_1_3_2_2_5_1","volume-title":"In Proceedings of the IASTED Conference on Parallel and Distributed Computing and Systems. 617\u2013662","author":"Beyls Kristof","unstructured":"Kristof Beyls and Erik H . D\u2019Hollander. 2001. Reuse Distance as a Metric for Cache Behavior . In In Proceedings of the IASTED Conference on Parallel and Distributed Computing and Systems. 617\u2013662 . Kristof Beyls and Erik H. D\u2019Hollander. 2001. Reuse Distance as a Metric for Cache Behavior. In In Proceedings of the IASTED Conference on Parallel and Distributed Computing and Systems. 617\u2013662."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2004.09.004"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2024716.2024718"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1379022.1375595"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/782814.782836"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063454"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/195470.195557"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/381694.378859"},{"key":"e_1_3_2_2_13_1","volume-title":"Scalable and precise refinement of cache timing analysis via path-sensitive verification. Real-Time Systems 49, 4 (01","author":"Chattopadhyay Sudipta","year":"2013","unstructured":"Sudipta Chattopadhyay and Abhik Roychoudhury . 2013. Scalable and precise refinement of cache timing analysis via path-sensitive verification. Real-Time Systems 49, 4 (01 Jul 2013 ), 517\u2013562. Sudipta Chattopadhyay and Abhik Roychoudhury. 2013. Scalable and precise refinement of cache timing analysis via path-sensitive verification. Real-Time Systems 49, 4 (01 Jul 2013), 517\u2013562."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192402"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/780822.781159"},{"key":"e_1_3_2_2_16_1","volume-title":"2010 IEEE International Symposium on. IEEE, 55\u201365","author":"Eklov David","year":"2010","unstructured":"David Eklov and Erik Hagersten . 2010 . StatStack: Efficient modeling of LRU caches. In Performance Analysis of Systems & Software (ISPASS) , 2010 IEEE International Symposium on. IEEE, 55\u201365 . David Eklov and Erik Hagersten. 2010. StatStack: Efficient modeling of LRU caches. In Performance Analysis of Systems & Software (ISPASS), 2010 IEEE International Symposium on. IEEE, 55\u201365."},{"key":"e_1_3_2_2_17_1","volume-title":"Hill","author":"Elder Jan","year":"2003","unstructured":"Jan Elder and Mark D . Hill . 2003 . Dinero IV Trace-Driven Uniprocessor Cache Simulator . Jan Elder and Mark D. Hill. 2003. Dinero IV Trace-Driven Uniprocessor Cache Simulator."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(99)00010-6"},{"key":"e_1_3_2_2_19_1","unstructured":"M. J. Fischer and M. O. Rabin. 1974. SUPER-EXPONENTIAL COMPLEX-ITY OF PRESBURGER ARITHMETIC. Technical Report. Cambridge MA USA.   M. J. Fischer and M. O. Rabin. 1974. SUPER-EXPONENTIAL COMPLEX-ITY OF PRESBURGER ARITHMETIC. Technical Report. Cambridge MA USA."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/325478.325479"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3242953.3242964"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.805152"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807644"},{"key":"e_1_3_2_2_25_1","volume-title":"On modeling and analyzing cache hierarchies using CASPER. In null","author":"Iyer Ravi","unstructured":"Ravi Iyer . 2003. On modeling and analyzing cache hierarchies using CASPER. In null . IEEE , 182. Ravi Iyer. 2003. On modeling and analyzing cache hierarchies using CASPER. In null. IEEE, 182."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/143369.143427"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/107972.107995"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.92.0078"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Frank Olken. 1981. Efficient methods for calculating the success function of fixed space replacement policies. (1981).  Frank Olken. 1981. Efficient methods for calculating the success function of fixed space replacement policies. (1981).","DOI":"10.2172\/6051879"},{"key":"e_1_3_2_2_32_1","volume-title":"Polybench: The polyhedral benchmark suite. URL: https:\/\/sourceforge.net\/projects\/polybench\/","author":"Pouchet Louis-No\u00ebl","year":"2012","unstructured":"Louis-No\u00ebl Pouchet . 2012 . Polybench: The polyhedral benchmark suite. URL: https:\/\/sourceforge.net\/projects\/polybench\/ (2012). Louis-No\u00ebl Pouchet. 2012. Polybench: The polyhedral benchmark suite. URL: https:\/\/sourceforge.net\/projects\/polybench\/ (2012)."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/166962.166974"},{"key":"e_1_3_2_2_34_1","volume-title":"Tools for High Performance Computing","author":"Terpstra Dan","year":"2009","unstructured":"Dan Terpstra , Heike Jagode , Haihang You , and Jack Dongarra . 2010. Collecting performance data with PAPI-C . In Tools for High Performance Computing 2009 . Springer , 157\u2013173. Dan Terpstra, Heike Jagode, Haihang You, and Jack Dongarra. 2010. Collecting performance data with PAPI-C. In Tools for High Performance Computing 2009. Springer, 157\u2013173."},{"key":"e_1_3_2_2_35_1","volume-title":"Ascertaining Uncertainty for Efficient Exact Cache Analysis. CoRR abs\/1709.10008","author":"Touzeau Valentin","year":"2017","unstructured":"Valentin Touzeau , Claire Ma\u00efza , David Monniaux , and Jan Reineke . 2017. Ascertaining Uncertainty for Efficient Exact Cache Analysis. CoRR abs\/1709.10008 ( 2017 ). Valentin Touzeau, Claire Ma\u00efza, David Monniaux, and Jan Reineke. 2017. Ascertaining Uncertainty for Efficient Exact Cache Analysis. CoRR abs\/1709.10008 (2017)."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290367"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/874076.876456"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1888390.1888455"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2400682.2400713"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-1231-0"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/113446.113449"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2011.66"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2490301.2451153"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.1275296"}],"event":{"name":"PLDI '19: 40th ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Phoenix AZ USA","acronym":"PLDI '19","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3314221.3314606","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3314221.3314606","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:22Z","timestamp":1750204402000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3314221.3314606"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,8]]},"references-count":41,"alternative-id":["10.1145\/3314221.3314606","10.1145\/3314221"],"URL":"https:\/\/doi.org\/10.1145\/3314221.3314606","relation":{},"subject":[],"published":{"date-parts":[[2019,6,8]]},"assertion":[{"value":"2019-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}