%0 Journal Article
%T Symbolic WCET Analysis of Programs Containing Input-Dependent Branches<br>包含依赖输入分支程序的符号化WCET分析
%A JI Meng-Luo
%A QI Zhi-Chang
%A WANG Huai-Min
%A <br>姬孟洛
%A 齐治昌
%A 王怀民
%J 软件学报
%D 2006
%I 
%X Symbolic WCET (worst-case execution time) analysis yields symbolic upper bound expressions for tasks that contain parameters. Quickly evaluated at run-time, such expressions can improve the accuracy of WCET estimate. This paper proposes a symbolic WCET analysis method that is especially for the input-data dependent branches. First, the formulas described by Blieberger is expanded, so that they can express the input-data dependent branches. Simplification of the formulas using control-dependent graph yields conditional symbolic expressions that have different forms corresponding to different input value ranges. Different from the existing methods, the symbolic formulas are directly dependent on input-data, so WCET estimate evaluation at run-time is more simple and straightforward.
%K parametric worst-case execution time (WCET) analysis
%K WCET analysis
%K program analysis
%K real-time system
%K software engineering<br>参数化最大执行时间WCET分析
%K WCET分析
%K 程序分析
%K 实时系统
%K 软件工程
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=0200F61B4CEF9D90&yid=37904DC365DD7266&vid=BCA2697F357F2001&iid=38B194292C032A66&sid=3EABEBD973E45554&eid=826ED638BDB6F0D0&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=14