基于UPPAAL的二进制程序时序分析

2013 13th International Conference on Application of Concurrency to System Design Pub Date : 2013-07-08 DOI:10.1109/ACSD.2013.7

F. Cassez, Jean-Luc Béchennec

{"title":"基于UPPAAL的二进制程序时序分析","authors":"F. Cassez, Jean-Luc Béchennec","doi":"10.1109/ACSD.2013.7","DOIUrl":null,"url":null,"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.","PeriodicalId":166715,"journal":{"name":"2013 13th International Conference on Application of Concurrency to System Design","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Timing Analysis of Binary Programs with UPPAAL\",\"authors\":\"F. Cassez, Jean-Luc Béchennec\",\"doi\":\"10.1109/ACSD.2013.7\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":166715,\"journal\":{\"name\":\"2013 13th International Conference on Application of Concurrency to System Design\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 13th International Conference on Application of Concurrency to System Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSD.2013.7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 13th International Conference on Application of Concurrency to System Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSD.2013.7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 17

摘要

我们解决了计算准确的最坏情况执行时间(WCET)的问题。我们提出了一种基于程序切片和实时模型检查的全自动模块化方法。我们已经实现了我们的方法，并将其应用于标准基准测试。为了进一步验证该方法，我们还将我们的结果与在实际电路板上测量的程序的实际执行时间进行了比较。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Timing Analysis of Binary Programs with UPPAAL

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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

自引率

0.00%

发文量