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.
@InProceedings{marref_et_al:OASIcs.WCET.2008.1667, author = {Marref, Amine and Bernat, Guillem}, title = {{Towards Predicated WCET Analysis}}, booktitle = {8th International Workshop on Worst-Case Execution Time Analysis (WCET'08)}, pages = {1--10}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-10-1}, ISSN = {2190-6807}, year = {2008}, volume = {8}, editor = {Kirner, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2008.1667}, URN = {urn:nbn:de:0030-drops-16670}, doi = {10.4230/OASIcs.WCET.2008.1667}, annote = {Keywords: WCET Analysis, Implicit-Path Enumeration-Technique, Constraint-Logic Programming, Static Analysis} }
Feedback for Dagstuhl Publishing