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/OASIcs.WCET.2008.1667
URN: urn:nbn:de:0030-drops-16670
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1667/
Marref, Amine ;
Bernat, Guillem
Towards Predicated WCET Analysis
Abstract
In this paper, we propose the use of constraint logic programming as a way of modeling context-sensitive execution-times of program segments. The context-sensitive constraints are collected automatically through static analysis or measurements. We achieve considerable tightness in comparison to traditional calculation methods that exceeded 20% in some cases during evaluation. The use of constraint-logic programming in our calculations proves to be the right choice when compared to the exponential behaviour recorded by the use of integer linear-programming.
BibTeX - Entry
@InProceedings{marref_et_al:OASIcs:2008:1667,
author = {Amine Marref and Guillem Bernat},
title = {{Towards Predicated WCET Analysis}},
booktitle = {8th International Workshop on Worst-Case Execution Time Analysis (WCET'08)},
series = {OpenAccess Series in Informatics (OASIcs)},
ISBN = {978-3-939897-10-1},
ISSN = {2190-6807},
year = {2008},
volume = {8},
editor = {Raimund Kirner},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2008/1667},
URN = {urn:nbn:de:0030-drops-16670},
doi = {10.4230/OASIcs.WCET.2008.1667},
note = {also published in print by Austrian Computer Society (OCG) with ISBN 978-3-85403-237-3},
annote = {Keywords: WCET Analysis, Implicit-Path Enumeration-Technique, Constraint-Logic Programming, Static Analysis}
}
Keywords: |
|
WCET Analysis, Implicit-Path Enumeration-Technique, Constraint-Logic Programming, Static Analysis |
Collection: |
|
8th International Workshop on Worst-Case Execution Time WCET Analysis (WCET'08) |
Issue Date: |
|
2008 |
Date of publication: |
|
13.11.2008 |