TY - GEN
T1 - Visualization and formalization of User Constraints for tight estimation of worst-case execution time
AU - Lee, Jong In
AU - Bang, Ho Jung
AU - Kim, Tai Hyo
AU - Cha, Sung Deok
PY - 2008
Y1 - 2008
N2 - Automated static timing analysis methods provide a safe but usually overestimated worst-case execution time (WCET). Overestimation is mainly due to the existence of the execution paths that turn out to be infeasible or unrealistic when dynamic behavior of the program or environmental assumptions are fully considered. In this paper, we propose a new method and a visual language called User Constraint Language (UCL) to obtain a tight WCET estimation. In our method, both the program and flow information are represented by single formalism-finite automata. UCL provides intuitive visual notations with which users can easily specify various levels of flow information to characterize the execution paths of program. The user constraints specified in UCL are translated into finite automata. The combined automaton constructed by a cross-production of the automata for program and user constraints reflects the static structure and possible dynamic behavior of the program. It contains only the execution paths satisfying user constraints from which we can obtain a tight WCET using a path-based or Implicit Path Enumeration Technique (IPET)-based calculation method. A case study using part of a satellite flight software program demonstrates the effectiveness of UCL and our approach.
AB - Automated static timing analysis methods provide a safe but usually overestimated worst-case execution time (WCET). Overestimation is mainly due to the existence of the execution paths that turn out to be infeasible or unrealistic when dynamic behavior of the program or environmental assumptions are fully considered. In this paper, we propose a new method and a visual language called User Constraint Language (UCL) to obtain a tight WCET estimation. In our method, both the program and flow information are represented by single formalism-finite automata. UCL provides intuitive visual notations with which users can easily specify various levels of flow information to characterize the execution paths of program. The user constraints specified in UCL are translated into finite automata. The combined automaton constructed by a cross-production of the automata for program and user constraints reflects the static structure and possible dynamic behavior of the program. It contains only the execution paths satisfying user constraints from which we can obtain a tight WCET using a path-based or Implicit Path Enumeration Technique (IPET)-based calculation method. A case study using part of a satellite flight software program demonstrates the effectiveness of UCL and our approach.
UR - http://www.scopus.com/inward/record.url?scp=49349102263&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=49349102263&partnerID=8YFLogxK
U2 - 10.1109/AERO.2008.4526588
DO - 10.1109/AERO.2008.4526588
M3 - Conference contribution
AN - SCOPUS:49349102263
SN - 1424414881
SN - 9781424414888
T3 - IEEE Aerospace Conference Proceedings
BT - 2008 IEEE Aerospace Conference, AC
T2 - 2008 IEEE Aerospace Conference, AC
Y2 - 1 March 2008 through 8 March 2008
ER -