Preliminaries Introduction in K The Language Definition Framework for Timing Analysis Conclusions Towards Semantics-Based WCET Analysis — WCET 2011 Mihail Asavoae Faculty of Computer Science, Alexandru Ioan Cuza University, Iasi, Romania Joint Work with Dorel Lucanu (UAIC) and Grigore Ros ¸ u (UIUC) Mihail Asavoae: Towards Semantics-Based WCET Analysis — WCET 2011 1/25
48
Embed
Towards Semantics-Based WCET Analysis @let@token WCET …fsl.cs.illinois.edu/FSL/presentations/2011/2011-07-WCET.pdf · 2016. 2. 15. · WCET Analysis — WCET 2011 Mihail Asavoae
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Preliminaries Introduction in K The Language Definition Framework for Timing Analysis Conclusions
Towards Semantics-Based
WCET Analysis
— WCET 2011
Mihail Asavoae
Faculty of Computer Science,
Alexandru Ioan Cuza University, Iasi, Romania
Joint Work with Dorel Lucanu (UAIC) and
Grigore Rosu (UIUC)
Mihail Asavoae: Towards Semantics-Based WCET Analysis — WCET 2011 1/25
Preliminaries Introduction in K The Language Definition Framework for Timing Analysis Conclusions
Outline
1 Preliminaries
2 Introduction in K
3 The Language Definition
4 Framework for Timing Analysis
5 Conclusions
Mihail Asavoae: Towards Semantics-Based WCET Analysis — WCET 2011 2/25
Preliminaries Introduction in K The Language Definition Framework for Timing Analysis Conclusions
Outline
1 Preliminaries
2 Introduction in K
3 The Language Definition
4 Framework for Timing Analysis
5 Conclusions
Mihail Asavoae: Towards Semantics-Based WCET Analysis — WCET 2011 3/25
Preliminaries Introduction in K The Language Definition Framework for Timing Analysis Conclusions
Worst-Case Execution Time... settings
WCET analysis:the longest execution time of a program
running on a particular architecture
Program:consider all executions - path analysis
Architecture:consider the impact over the executed program -processor behavior analysis
Mihail Asavoae: Towards Semantics-Based WCET Analysis — WCET 2011 4/25
Preliminaries Introduction in K The Language Definition Framework for Timing Analysis Conclusions
Typical WCET Analyzer... issues and solutions
DISCLAIMER: Image taken from Reinhard Wilhem & all”The Worst-Case Execution Time Problem - Overview of Methods and Survey of Tools”, in TECS 2008
Program:
Architecture:
Mihail Asavoae: Towards Semantics-Based WCET Analysis — WCET 2011 5/25
Preliminaries Introduction in K The Language Definition Framework for Timing Analysis Conclusions
Typical WCET Analyzer... issues and solutions
DISCLAIMER: Image taken from Reinhard Wilhem & all”The Worst-Case Execution Time Problem - Overview of Methods and Survey of Tools”, in TECS 2008
Program: CFG extraction,
Architecture:
Mihail Asavoae: Towards Semantics-Based WCET Analysis — WCET 2011 5/25
Preliminaries Introduction in K The Language Definition Framework for Timing Analysis Conclusions
Typical WCET Analyzer... issues and solutions
DISCLAIMER: Image taken from Reinhard Wilhem & all”The Worst-Case Execution Time Problem - Overview of Methods and Survey of Tools”, in TECS 2008
Program: CFG extraction, loop bounds calculation,
Architecture:
Mihail Asavoae: Towards Semantics-Based WCET Analysis — WCET 2011 5/25
Preliminaries Introduction in K The Language Definition Framework for Timing Analysis Conclusions
Typical WCET Analyzer... issues and solutions
DISCLAIMER: Image taken from Reinhard Wilhem & all”The Worst-Case Execution Time Problem - Overview of Methods and Survey of Tools”, in TECS 2008
Mihail Asavoae: Towards Semantics-Based WCET Analysis — WCET 2011 22/25
Preliminaries Introduction in K The Language Definition Framework for Timing Analysis Conclusions
Background information... on the technology we use
K specifications are compiled into Maude rewrite theories- the search command performs reachability analysis on the
abstract rewrite transitional system produced by the Kspecification of the language
Mihail Asavoae: Towards Semantics-Based WCET Analysis — WCET 2011 23/25
Preliminaries Introduction in K The Language Definition Framework for Timing Analysis Conclusions
Background information... on the technology we use
K specifications are compiled into Maude rewrite theories- the search command performs reachability analysis on the
abstract rewrite transitional system produced by the Kspecification of the language
To guarantee a safe WCET bound, we explore all programexecutions, using reachability for the state that has in the〈 〉k cell a special token, called last
- normal termination: the instruction for last was executed
- error termination: the final executed instruction is a break
Mihail Asavoae: Towards Semantics-Based WCET Analysis — WCET 2011 23/25
Preliminaries Introduction in K The Language Definition Framework for Timing Analysis Conclusions
Background information... on the technology we use
K specifications are compiled into Maude rewrite theories- the search command performs reachability analysis on the
abstract rewrite transitional system produced by the Kspecification of the language
To guarantee a safe WCET bound, we explore all programexecutions, using reachability for the state that has in the〈 〉k cell a special token, called last
- normal termination: the instruction for last was executed
- error termination: the final executed instruction is a break
Site:http://code.google.com/p/k-framework/
source/browse/ → inProgress → ssrisc
Mihail Asavoae: Towards Semantics-Based WCET Analysis — WCET 2011 23/25
Preliminaries Introduction in K The Language Definition Framework for Timing Analysis Conclusions
Outline
1 Preliminaries
2 Introduction in K
3 The Language Definition
4 Framework for Timing Analysis
5 Conclusions
Mihail Asavoae: Towards Semantics-Based WCET Analysis — WCET 2011 24/25
Preliminaries Introduction in K The Language Definition Framework for Timing Analysis Conclusions
Towards Semantics-Based WCET Analysis... a different perspective on the problem
We propose a framework for WCET analysis based on theformal executable semantics of a RISC assembly language
We use the concrete semantics of a program running on aparticular architecture to obtain the abstract semanticsfor computing time bounds
The focus is on the error path detection at the low level,a subproblem of the infeasible path detection
Mihail Asavoae: Towards Semantics-Based WCET Analysis — WCET 2011 25/25