2026-07-21T21:12:21Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:816 2024-03-06T10:28:19Z ddc:004 open_access

Exploiting Branch Constraints without Exhaustive Path Enumeration Chen, Ting Mitra, Tulika Roychoudhury, Abhik Suhendra, Vivy WCET infeasible path branch constraints Statically estimating the worst case execution time (WCET) of a program is important for real-time software. This is difficult even in the programming language level due to the inherent difficulty in detecting and exploiting infeasible paths in a program’s control flow graph. In this paper, we propose an efficient method to exploit infeasible path information for WCET estimation of a loop without resorting to exhaustive path enumeration. The ef- ficiency of our approach is demonstrated with a real-life control-intensive program. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Ting Chen and Tulika Mitra and Abhik Roychoudhury and Vivy Suhendra 2007 Is Part Of OASIcs, Volume 1, 5th International Workshop on Worst-Case Execution Time Analysis (WCET'05) (2007) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.WCET.2005.816 urn:nbn:de:0030-drops-8163 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2005.816 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode