{"intvolume":"      9032","citation":{"apa":"Cerny, P., Henzinger, T. A., Kovács, L., Radhakrishna, A., &#38; Zwirchmayr, J. (2015). Segment abstraction for worst-case execution time analysis. Presented at the ESOP: European Symposium on Programming, London, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-662-46669-8_5\">https://doi.org/10.1007/978-3-662-46669-8_5</a>","ista":"Cerny P, Henzinger TA, Kovács L, Radhakrishna A, Zwirchmayr J. 2015. Segment abstraction for worst-case execution time analysis. 9032, 105–131.","chicago":"Cerny, Pavol, Thomas A Henzinger, Laura Kovács, Arjun Radhakrishna, and Jakob Zwirchmayr. “Segment Abstraction for Worst-Case Execution Time Analysis.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46669-8_5\">https://doi.org/10.1007/978-3-662-46669-8_5</a>.","ama":"Cerny P, Henzinger TA, Kovács L, Radhakrishna A, Zwirchmayr J. Segment abstraction for worst-case execution time analysis. 2015;9032:105-131. doi:<a href=\"https://doi.org/10.1007/978-3-662-46669-8_5\">10.1007/978-3-662-46669-8_5</a>","ieee":"P. Cerny, T. A. Henzinger, L. Kovács, A. Radhakrishna, and J. Zwirchmayr, “Segment abstraction for worst-case execution time analysis,” vol. 9032. Springer, pp. 105–131, 2015.","mla":"Cerny, Pavol, et al. <i>Segment Abstraction for Worst-Case Execution Time Analysis</i>. Vol. 9032, Springer, 2015, pp. 105–31, doi:<a href=\"https://doi.org/10.1007/978-3-662-46669-8_5\">10.1007/978-3-662-46669-8_5</a>.","short":"P. Cerny, T.A. Henzinger, L. Kovács, A. Radhakrishna, J. Zwirchmayr, 9032 (2015) 105–131."},"date_published":"2015-04-01T00:00:00Z","title":"Segment abstraction for worst-case execution time analysis","quality_controlled":"1","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"ec_funded":1,"month":"04","year":"2015","alternative_title":["LNCS"],"oa_version":"None","date_updated":"2020-08-11T10:09:32Z","publist_id":"5266","status":"public","author":[{"last_name":"Cerny","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Kovács, Laura","first_name":"Laura","last_name":"Kovács"},{"last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"},{"last_name":"Zwirchmayr","first_name":"Jakob","full_name":"Zwirchmayr, Jakob"}],"conference":{"name":"ESOP: European Symposium on Programming","end_date":"2015-04-18","location":"London, United Kingdom","start_date":"2015-04-11"},"series_title":"Lecture Notes in Computer Science","page":"105 - 131","type":"conference","doi":"10.1007/978-3-662-46669-8_5","day":"01","publisher":"Springer","department":[{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":9032,"abstract":[{"text":"In the standard framework for worst-case execution time (WCET) analysis of programs, the main data structure is a single instance of integer linear programming (ILP) that represents the whole program. The instance of this NP-hard problem must be solved to find an estimate forWCET, and it must be refined if the estimate is not tight.We propose a new framework for WCET analysis, based on abstract segment trees (ASTs) as the main data structure. The ASTs have two advantages. First, they allow computing WCET by solving a number of independent small ILP instances. Second, ASTs store more expressive constraints, thus enabling a more efficient and precise refinement procedure. In order to realize our framework algorithmically, we develop an algorithm for WCET estimation on ASTs, and we develop an interpolation-based counterexample-guided refinement scheme for ASTs. Furthermore, we extend our framework to obtain parametric estimates of WCET. We experimentally evaluate our approach on a set of examples from WCET benchmark suites and linear-algebra packages. We show that our analysis, with comparable effort, provides WCET estimates that in many cases significantly improve those computed by existing tools.","lang":"eng"}],"date_created":"2018-12-11T11:54:16Z","publication_status":"published","language":[{"iso":"eng"}],"scopus_import":1,"_id":"1836"}