License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICLP.2010.303
URN: urn:nbn:de:0030-drops-26140
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2614/
Zwirchmayr, Jakob
Cutting-Edge Timing Analysis Techniques
Abstract
This text gives an overview about my current research in timing analysis at the Vienna University of Technology. After a short introduction to the topic follows the description of an approach relying on CLP, the implicit path enumeration technique (IPET). This technique is also used in a tool developed at the institute of Computer Languages (TuBound). Current timing analysis tools suffer from a few flaws worth further investigation in order to achieve better results than current state-of-the-art timing analysis tools.
BibTeX - Entry
@InProceedings{zwirchmayr:LIPIcs:2010:2614,
author = {Jakob Zwirchmayr},
title = {{Cutting-Edge Timing Analysis Techniques}},
booktitle = {Technical Communications of the 26th International Conference on Logic Programming},
pages = {303--305},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-17-0},
ISSN = {1868-8969},
year = {2010},
volume = {7},
editor = {Manuel Hermenegildo and Torsten Schaub},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2614},
URN = {urn:nbn:de:0030-drops-26140},
doi = {10.4230/LIPIcs.ICLP.2010.303},
annote = {Keywords: Verification, timing analysis, hard real-time systems, static analysis, worst-case execution time, loop-invariants, nested loop, symbolic computation,}
}
Keywords: |
|
Verification, timing analysis, hard real-time systems, static analysis, worst-case execution time, loop-invariants, nested loop, symbolic computation, |
Collection: |
|
Technical Communications of the 26th International Conference on Logic Programming |
Issue Date: |
|
2010 |
Date of publication: |
|
25.06.2010 |