Visualization and formalization of user constraints for a tight estimation of worst-case execution time정확한 최장수행시간 예측을 위한 사용자 제약사항의 시각화 및 정형화

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 537
  • Download : 0
Timing analysis is an essential process for development of real-time embedded system and knowledge about the worst-case execution time (WCET) is crucial to validation of temporal correctness of implemented system. Research on automated static timing analysis is actively in progress to complement limitation of traditional timing measurement method. Automated static timing analysis methods provide safe but usually overestimated worst-cast execution time (WCET). Overestimation is mainly due to the existence of execution paths which turn out to be infeasible or impractical if dynamic behaviors of a program or environmental assumptions are fully considered. Therefore, user annotation of additional flow information is required for static WCET analyzer to get a tighter WCET estimation. In this thesis, we propose a new method and a visual language, User Constraint Language (UCL), to facilitate the specification of user constraints. In our method, both 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 execution paths of program. User constraints specified in UCL formulas are converted into corresponding finite automata. They are combined with the automaton representing the control flow graph of a target program through cross production. The combined automaton reflects the static structure and possible dynamic behavior of the program, and does not contain infeasible or impractical execution paths that are the main cause of loose estimation of WCET. We describe the visual notation and textual formula of UCL with examples which illustrate their usage. Then we define the formal syntax and semantics of UCL and propose a translation scheme to convert UCL formulas into finite automata. We also present a method to check the consistency of user-provided UCL constraints. UCL can specify complex flow information to elimi...
Advisors
Bae, Doo-Hwanresearcher배두환researcher
Description
한국과학기술원 : 전산학전공,
Publisher
한국과학기술원
Issue Date
2009
Identifier
309337/325007  / 000995289
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전산학전공, 2009.2, [ vii, 54 p. ]

Keywords

worst-case execution time; user constraint; control flow graph; finite automata; 최장수행시간; 사용자 제약사항; 제어흐름도; 유한 오토마타; worst-case execution time; user constraint; control flow graph; finite automata; 최장수행시간; 사용자 제약사항; 제어흐름도; 유한 오토마타

URI
http://hdl.handle.net/10203/33263
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=309337&flag=dissertation
Appears in Collection
CS-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0