{"title":"A tool for automatic flow analysis of C-programs for WCET calculation","authors":"J. Gustafsson, B. Lisper, C. Sandberg, N. Bermudo","doi":"10.1109/WORDS.2003.1218072","DOIUrl":null,"url":null,"abstract":"Bounding the worst case execution time (WCET) of programs is essential for real-time systems. To be able to do WCET calculations, the iteration bounds for loops and recursion must be known. We describe a prototype tool that calculates these bounds automatically, thereby avoiding the need for manual annotations by the programmer. The analysis is based on an intermediate code representation, which means that compiler optimized code is analyzed. The choice of intermediate code also allows the analysis to support the number of programming languages. C programs are targeted. We also show an example of a program analysis using our method.","PeriodicalId":225796,"journal":{"name":"Proceedings of the Eighth International Workshop on Object-Oriented Real-Time Dependable Systems, 2003. (WORDS 2003).","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"37","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Eighth International Workshop on Object-Oriented Real-Time Dependable Systems, 2003. (WORDS 2003).","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WORDS.2003.1218072","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 37
Abstract
Bounding the worst case execution time (WCET) of programs is essential for real-time systems. To be able to do WCET calculations, the iteration bounds for loops and recursion must be known. We describe a prototype tool that calculates these bounds automatically, thereby avoiding the need for manual annotations by the programmer. The analysis is based on an intermediate code representation, which means that compiler optimized code is analyzed. The choice of intermediate code also allows the analysis to support the number of programming languages. C programs are targeted. We also show an example of a program analysis using our method.