用于缓存和管道建模的时间自动机

Mars (Los Angeles, Calif.) Pub Date : 2015-11-08 DOI:10.4204/EPTCS.196.4

F. Cassez, Pablo González de Aledo Marugán

{"title":"用于缓存和管道建模的时间自动机","authors":"F. Cassez, Pablo González de Aledo Marugán","doi":"10.4204/EPTCS.196.4","DOIUrl":null,"url":null,"abstract":"In this paper, we focus on modelling the timing aspects of binary programs running on architectures featuring caches and pipelines. The objective is to obtain a timed automaton model to compute tight bounds for the worst-case execution time (WCET) of the programs using model-checking tehcniques.","PeriodicalId":92263,"journal":{"name":"Mars (Los Angeles, Calif.)","volume":"550 1","pages":"37-45"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Timed Automata for Modelling Caches and Pipelines\",\"authors\":\"F. Cassez, Pablo González de Aledo Marugán\",\"doi\":\"10.4204/EPTCS.196.4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we focus on modelling the timing aspects of binary programs running on architectures featuring caches and pipelines. The objective is to obtain a timed automaton model to compute tight bounds for the worst-case execution time (WCET) of the programs using model-checking tehcniques.\",\"PeriodicalId\":92263,\"journal\":{\"name\":\"Mars (Los Angeles, Calif.)\",\"volume\":\"550 1\",\"pages\":\"37-45\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mars (Los Angeles, Calif.)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.196.4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mars (Los Angeles, Calif.)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.196.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

在本文中，我们着重于对运行在具有缓存和管道的架构上的二进制程序的时序方面进行建模。目标是获得一个时间自动机模型，使用模型检查技术计算程序的最坏情况执行时间(WCET)的严格界限。

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

查看原文本刊更多论文

Timed Automata for Modelling Caches and Pipelines

In this paper, we focus on modelling the timing aspects of binary programs running on architectures featuring caches and pipelines. The objective is to obtain a timed automaton model to compute tight bounds for the worst-case execution time (WCET) of the programs using model-checking tehcniques.

求助全文

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

来源期刊

Mars (Los Angeles, Calif.)

自引率

0.00%

发文量