Loading...
Please wait, while we are loading the content...
Similar Documents
An Evaluation of WCET Analysis using Symbolic Loop Bounds
| Content Provider | Semantic Scholar |
|---|---|
| Author | Knoop, Jens Kovács, Laura Zwirchmayr, Jakob |
| Copyright Year | 2011 |
| Abstract | In this paper we evaluate a symbolic loop bound generation technique recently proposed by the authors in [7]. The technique deploys pattern-based recurrence solving in conjunction with program flow refinement using SMT reasoning. The derived bounds are further used in the WCET analysis of programs with loops. This paper presents experimental evaluations of the method carried out with the r-TuBound software tool. We evaluate our method against various academic and industrial WCET benchmarks, and outline further challenges for symbolic loop bound computation. |
| Starting Page | 93 |
| Ending Page | 103 |
| Page Count | 11 |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://publik.tuwien.ac.at/files/PubDat_205557.pdf |
| Alternate Webpage(s) | https://publik.tuwien.ac.at/files/PubDat_198260.pdf |
| Alternate Webpage(s) | http://publik.tuwien.ac.at/files/PubDat_198260.pdf |
| Alternate Webpage(s) | http://www.complang.tuwien.ac.at/jakob/web/jz_wcetws2011.pdf |
| Alternate Webpage(s) | https://publik.tuwien.ac.at/files/PubDat_205557.pdf |
| Journal | WCET 2011 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |