Timing analysis of binary programs with UPPAAL

Franck Cassez; Jean Luc Bechennec

doi:10.1109/ACSD.2013.7

Timing analysis of binary programs with UPPAAL

Franck Cassez, Jean Luc Bechennec

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

12 Citations (Scopus)

Abstract

We address the problem of computing accurate Worst-Case Execution Time (WCET). We propose a fully automatic and modular methodology based on program slicing and real-time model-checking. We have implemented our methodology and applied it to standard benchmarks. To further validate the approach, we also compare our results to the real execution times of the programs measured on a real board.

Original language	English
Title of host publication	Proceedings 2013 13th International Conference on Application of Concurrency to System Design
Subtitle of host publication	ACSD 2013
Place of Publication	Piscataway, NJ
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	41-50
Number of pages	10
ISBN (Electronic)	9780769550350
DOIs	https://doi.org/10.1109/ACSD.2013.7
Publication status	Published - 2013
Externally published	Yes
Event	2013 13th International Conference on Application of Concurrency to System Design, ACSD 2013 - Barcelona, Spain Duration: 8 Jul 2013 → 10 Jul 2013

Other

Other	2013 13th International Conference on Application of Concurrency to System Design, ACSD 2013
Country/Territory	Spain
City	Barcelona
Period	8/07/13 → 10/07/13

Access to Document

10.1109/ACSD.2013.7

Cite this

@inproceedings{4291e48fa0234057ab7ca4961b5a156d,

title = "Timing analysis of binary programs with UPPAAL",

abstract = "We address the problem of computing accurate Worst-Case Execution Time (WCET). We propose a fully automatic and modular methodology based on program slicing and real-time model-checking. We have implemented our methodology and applied it to standard benchmarks. To further validate the approach, we also compare our results to the real execution times of the programs measured on a real board.",

author = "Franck Cassez and Bechennec, \{Jean Luc\}",

year = "2013",

doi = "10.1109/ACSD.2013.7",

language = "English",

pages = "41--50",

booktitle = "Proceedings 2013 13th International Conference on Application of Concurrency to System Design",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

note = "2013 13th International Conference on Application of Concurrency to System Design, ACSD 2013 ; Conference date: 08-07-2013 Through 10-07-2013",

}

Cassez, F & Bechennec, JL 2013, Timing analysis of binary programs with UPPAAL. in Proceedings 2013 13th International Conference on Application of Concurrency to System Design: ACSD 2013., 6598339, Institute of Electrical and Electronics Engineers (IEEE), Piscataway, NJ, pp. 41-50, 2013 13th International Conference on Application of Concurrency to System Design, ACSD 2013, Barcelona, Spain, 8/07/13. https://doi.org/10.1109/ACSD.2013.7

Timing analysis of binary programs with UPPAAL. / Cassez, Franck; Bechennec, Jean Luc.
Proceedings 2013 13th International Conference on Application of Concurrency to System Design: ACSD 2013. Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2013. p. 41-50 6598339.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Timing analysis of binary programs with UPPAAL

AU - Cassez, Franck

AU - Bechennec, Jean Luc

PY - 2013

Y1 - 2013

N2 - We address the problem of computing accurate Worst-Case Execution Time (WCET). We propose a fully automatic and modular methodology based on program slicing and real-time model-checking. We have implemented our methodology and applied it to standard benchmarks. To further validate the approach, we also compare our results to the real execution times of the programs measured on a real board.

AB - We address the problem of computing accurate Worst-Case Execution Time (WCET). We propose a fully automatic and modular methodology based on program slicing and real-time model-checking. We have implemented our methodology and applied it to standard benchmarks. To further validate the approach, we also compare our results to the real execution times of the programs measured on a real board.

UR - https://www.scopus.com/pages/publications/84885572497

U2 - 10.1109/ACSD.2013.7

DO - 10.1109/ACSD.2013.7

M3 - Conference proceeding contribution

AN - SCOPUS:84885572497

SP - 41

EP - 50

BT - Proceedings 2013 13th International Conference on Application of Concurrency to System Design

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, NJ

T2 - 2013 13th International Conference on Application of Concurrency to System Design, ACSD 2013

Y2 - 8 July 2013 through 10 July 2013

ER -

Timing analysis of binary programs with UPPAAL

Abstract

Other

Access to Document

Other files and links

Fingerprint

Cite this