Changeset 3441
- Timestamp:
- Feb 17, 2014, 11:17:28 AM (7 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
Papers/fopara2013/fopara13.tex
r3438 r3441 155 155 reduce non-functional verification to the functional case and exploit the state 156 156 of the art in automated high-level verification~\cite{survey}. The techniques 157 currently used by the Worst Case Execution Time (WCET) community, wh ich perform the analysis on object code,157 currently used by the Worst Case Execution Time (WCET) community, who perform analyses on object code, 158 158 are still available but can now be coupled with an additional source-level 159 159 analysis. Where the approach produces precise cost models too complex to reason … … 169 169 very lightweight tracking of code changes through compilation. We have studied 170 170 how to formally prove the correctness of compilers implementing this technique. 171 We have implemented such a compiler from C to object binaries for the 8051171 We have implemented such a compiler from C to object binaries for the MCS-51 172 172 micro-controller for predicting execution time and stack space usage, 173 173 and verified it in an interactive theorem prover. As we are targeting … … 180 180 program respects these costs by calling automated theorem provers, a 181 181 new and innovative technique in the field of cost analysis. Finally, 182 we have conduct several case studies, including showing that the182 we have conducted several case studies, including showing that the 183 183 plugin can automatically compute and certify the exact reaction time 184 184 of Lustre~\cite{lustre} data flow programs compiled into C.
Note: See TracChangeset
for help on using the changeset viewer.