{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:48Z","timestamp":1750220928466,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T00:00:00Z","timestamp":1561248000000},"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":[],"published-print":{"date-parts":[[2019,6,23]]},"DOI":"10.1145\/3316482.3326353","type":"proceedings-article","created":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T21:02:18Z","timestamp":1559941338000},"page":"208-212","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Imprecision in WCET estimates due to library calls and how to reduce it (WIP paper)"],"prefix":"10.1145","author":[{"given":"Martin","family":"Becker","sequence":"first","affiliation":[{"name":"TU Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samarjit","family":"Chakraborty","sequence":"additional","affiliation":[{"name":"TU Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravindra","family":"Metta","sequence":"additional","affiliation":[{"name":"TCS Research, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Venkatesh","sequence":"additional","affiliation":[{"name":"TCS Research, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"OTAWA: An Open Toolbox for Adaptive WCET Analysis. In Proc. Software Technologies for Embedded and Ubiquitous Systems (LNCS)","author":"Ballabriga C.","year":"2010","unstructured":"C. Ballabriga 2010 . OTAWA: An Open Toolbox for Adaptive WCET Analysis. In Proc. Software Technologies for Embedded and Ubiquitous Systems (LNCS) , S.L. Min et al. (Eds.), Vol. 6399 . Springer , 35-46. C. Ballabriga et al. 2010. OTAWA: An Open Toolbox for Adaptive WCET Analysis. In Proc. Software Technologies for Embedded and Ubiquitous Systems (LNCS), S.L. Min et al. (Eds.), Vol. 6399. Springer, 35-46."},{"volume-title":"Proc. Real-Time and Embedded Technology and Applications Symposium (RTAS). IEEE Computer Society, 87-96","author":"Banerjee A.","key":"e_1_3_2_1_2_1","unstructured":"A. Banerjee , S. Chattopadhyay , and A. Roychoudhury . 2013. Precise micro-architectural modeling for WCET analysis via AI+SAT . In Proc. Real-Time and Embedded Technology and Applications Symposium (RTAS). IEEE Computer Society, 87-96 . A. Banerjee, S. Chattopadhyay, and A. Roychoudhury. 2013. Precise micro-architectural modeling for WCET analysis via AI+SAT. In Proc. Real-Time and Embedded Technology and Applications Symposium (RTAS). IEEE Computer Society, 87-96."},{"key":"e_1_3_2_1_3_1","unstructured":"M. Becker etal 2018. Scalable and precise estimation and debugging of the worst-case execution time for analysis-friendly processors. Journal on Software Tools for Technology Transfer (2018) 1-29.  M. Becker et al. 2018. Scalable and precise estimation and debugging of the worst-case execution time for analysis-friendly processors. Journal on Software Tools for Technology Transfer (2018) 1-29."},{"key":"e_1_3_2_1_4_1","unstructured":"D Brumley etal 2013. Native x86 decompilation using semantics-preserving structural analysis and iterative control-flow structuring. In Presented as part of the 22nd USENIX Security Symposium. 353-368.   D Brumley et al. 2013. Native x86 decompilation using semantics-preserving structural analysis and iterative control-flow structuring. In Presented as part of the 22nd USENIX Security Symposium . 353-368."},{"key":"e_1_3_2_1_5_1","first-page":"1","volume-title":"Proc. Workshop on Worst-Case Execution Time Analysis, F.J. Cazorla (Ed.)","volume":"47","author":"Cass\u00e9 H.","year":"2015","unstructured":"H. Cass\u00e9 2015 . A Framework to Quantify the Overestimations of Static WCET Analysis . In Proc. Workshop on Worst-Case Execution Time Analysis, F.J. Cazorla (Ed.) , Vol. 47 . Schloss Dagstuhl , 1 - 10 . H. Cass\u00e9 et al. 2015. A Framework to Quantify the Overestimations of Static WCET Analysis. In Proc. Workshop on Worst-Case Execution Time Analysis, F.J. Cazorla (Ed.), Vol. 47. Schloss Dagstuhl, 1-10."},{"key":"e_1_3_2_1_6_1","first-page":"105","volume-title":"Proc. European Symposium on Programming (LNCS), J. Vitek (Ed.)","volume":"9032","author":"Cerny P.","year":"2015","unstructured":"P. Cerny 2015 . Segment Abstraction for Worst-Case Execution Time Analysis . In Proc. European Symposium on Programming (LNCS), J. Vitek (Ed.) , Vol. 9032 . Springer , 105 - 131 . P. Cerny et al. 2015. Segment Abstraction for Worst-Case Execution Time Analysis. In Proc. European Symposium on Programming (LNCS), J. Vitek (Ed.), Vol. 9032. Springer, 105-131."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"E.M. Clarke etal 2004. Completeness and Complexity of Bounded Model Checking See [18] 85-96.  E.M. Clarke et al. 2004. Completeness and Complexity of Bounded Model Checking See [18] 85-96.","DOI":"10.1007\/978-3-540-24622-0_9"},{"key":"e_1_3_2_1_8_1","first-page":"168","volume-title":"Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS) (LNCS), K. Jensen and A. Podelski (Eds.)","volume":"2988","author":"Clarke E.M.","unstructured":"E.M. Clarke , D. Kroening , and F. Lerda . 2004. A Tool for Checking ANSI-C Programs . In Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS) (LNCS), K. Jensen and A. Podelski (Eds.) , Vol. 2988 . Springer , 168 - 176 . E.M. Clarke, D. Kroening, and F. Lerda. 2004. A Tool for Checking ANSI-C Programs. In Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS) (LNCS), K. Jensen and A. Podelski (Eds.), Vol. 2988. Springer, 168-176."},{"key":"e_1_3_2_1_9_1","unstructured":"C. Collberg C. Thomborson and D. Low. 1997. A taxonomy of obfuscating transformations. Technical Report. Department of Computer Science The University of Auckland New Zealand.  C. Collberg C. Thomborson and D. Low. 1997. A taxonomy of obfuscating transformations . Technical Report. Department of Computer Science The University of Auckland New Zealand."},{"volume-title":"Proc. Symposium on Principles of Programming Languages, R.M. Graham et al. (Eds.). ACM, 238-252","author":"Cousot P.","key":"e_1_3_2_1_10_1","unstructured":"P. Cousot and R. Cousot . 1977. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints . In Proc. Symposium on Principles of Programming Languages, R.M. Graham et al. (Eds.). ACM, 238-252 . P. Cousot and R. Cousot. 1977. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proc. Symposium on Principles of Programming Languages, R.M. Graham et al. (Eds.). ACM, 238-252."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008186323068"},{"key":"e_1_3_2_1_12_1","first-page":"136","volume-title":"Present And Future. In International Workshop onWorst-Case Execution Time Analysis, B. Lisper (Ed.)","volume":"15","author":"Gustafsson J.","year":"2010","unstructured":"J. Gustafsson 2010 . The M\u00e4lardalen WCET Benchmarks: Past , Present And Future. In International Workshop onWorst-Case Execution Time Analysis, B. Lisper (Ed.) , Vol. 15 . Schloss Dagstuhl , 136 - 146 . J. Gustafsson et al. 2010. The M\u00e4lardalen WCET Benchmarks: Past, Present And Future. In International Workshop onWorst-Case Execution Time Analysis, B. Lisper (Ed.), Vol. 15. Schloss Dagstuhl, 136-146."},{"key":"e_1_3_2_1_13_1","volume-title":"Apron: A Library of Numerical Abstract Domains for Static Analysis","author":"Jeannet B.","year":"2009","unstructured":"B. Jeannet and A. Min\u00e9 . 2009 . Apron: A Library of Numerical Abstract Domains for Static Analysis . In Proc. Computer Aided Verification, Ahmed Bouajjani and Oded Maler (Eds.), Vol. 5643 . Springer , 661-667. B. Jeannet and A. Min\u00e9. 2009. Apron: A Library of Numerical Abstract Domains for Static Analysis. In Proc. Computer Aided Verification, Ahmed Bouajjani and Oded Maler (Eds.), Vol. 5643. Springer, 661-667."},{"key":"e_1_3_2_1_14_1","unstructured":"A. Kanamori and D. Weise. 1992. An Empirical Study of an Abstract Interpretation of Scheme Programs. Technical Report. Stanford USA.   A. Kanamori and D. Weise. 1992. An Empirical Study of an Abstract Interpretation of Scheme Programs . Technical Report. Stanford USA."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-012-0255-9"},{"volume-title":"Proc. Verification, Model Checking, and Abstract Interpretation (VMCAI). 43-60","author":"Nagar K.","key":"e_1_3_2_1_16_1","unstructured":"K. Nagar and Y.N. Srikant . 2015. Path Sensitive Cache Analysis Using Cache Miss Paths . In Proc. Verification, Model Checking, and Abstract Interpretation (VMCAI). 43-60 . K. Nagar and Y.N. Srikant. 2015. Path Sensitive Cache Analysis Using Cache Miss Paths. In Proc. Verification, Model Checking, and Abstract Interpretation (VMCAI). 43-60."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14722\/bar.2018.23008"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/b94790"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. Principles of Programming Languages","volume":"3","author":"V","unstructured":"V Touzeau et al. 2019. Fast and exact analysis for LRU caches . In Proc. Principles of Programming Languages , Vol. 3 . ACM, 54. V Touzeau et al. 2019. Fast and exact analysis for LRU caches. In Proc. Principles of Programming Languages, Vol. 3. ACM, 54."},{"key":"e_1_3_2_1_20_1","first-page":"193","volume-title":"Proc. Conference on Programming Language Design and Implementation (PLDI'12)","author":"Volodymyr K.","year":"2012","unstructured":"K. Volodymyr 2012 . Efficient State Merging in Symbolic Execution . In Proc. Conference on Programming Language Design and Implementation (PLDI'12) . ACM, New York, NY, USA , 193 - 204 . K. Volodymyr et al. 2012. Efficient State Merging in Symbolic Execution. In Proc. Conference on Programming Language Design and Implementation (PLDI'12). ACM, New York, NY, USA, 193-204."},{"key":"e_1_3_2_1_21_1","first-page":"309","volume-title":"Nor ILP Alone, See [18]","author":"Wilhelm R.","unstructured":"R. Wilhelm . 2004. Why AI + ILP Is Good for WCET , but MC Is Not , Nor ILP Alone, See [18] , 309 - 322 . R. Wilhelm. 2004. Why AI + ILP Is Good for WCET, but MC Is Not, Nor ILP Alone, See [18], 309-322."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1347375.1347389"}],"event":{"name":"LCTES '19: 20th ACM SIGPLAN\/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGBED ACM Special Interest Group on Embedded Systems"],"location":"Phoenix AZ USA","acronym":"LCTES '19"},"container-title":["Proceedings of the 20th ACM SIGPLAN\/SIGBED International Conference on Languages, Compilers, and Tools for Embedded Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3316482.3326353","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3316482.3326353","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:16Z","timestamp":1750204396000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3316482.3326353"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,23]]},"references-count":22,"alternative-id":["10.1145\/3316482.3326353","10.1145\/3316482"],"URL":"https:\/\/doi.org\/10.1145\/3316482.3326353","relation":{},"subject":[],"published":{"date-parts":[[2019,6,23]]},"assertion":[{"value":"2019-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}