两种用于形式验证的SystemC/TLM语义的比较

2008 6th ACM/IEEE International Conference on Formal Methods and Models for Co-Design Pub Date : 2008-06-05 DOI:10.1109/MEMCOD.2008.4547687

C. Helmstetter, Olivier Ponsini

{"title":"两种用于形式验证的SystemC/TLM语义的比较","authors":"C. Helmstetter, Olivier Ponsini","doi":"10.1109/MEMCOD.2008.4547687","DOIUrl":null,"url":null,"abstract":"The development of complex systems mixing hardware and software starts more and more by the design of functional models written in SystemC/TLM. These models are used as golden models for embedded software validation and for hardware verification, therefore their own validation is an important issue. One thriving approach consists in describing the semantics of SystemC/TLM in a formal language for which a verification tool exists. In this paper, we use Lotos and the CADP toolbox as a unifying framework to define and experiment with two possible semantics for untimed SystemC/TLM, emphasizing either the nonpreemptive semantics of SystemC or the concurrent one of TIM. We also discuss and illustrate on a benchmark the qualitative versus quantitative performance trade-off offered by each semantics as regards verification. When associated with locks, our concurrent semantics appears both to provide more flexibility and to improve the scalability.","PeriodicalId":221804,"journal":{"name":"2008 6th ACM/IEEE International Conference on Formal Methods and Models for Co-Design","volume":"103 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"A Comparison of Two SystemC/TLM Semantics for Formal Verification\",\"authors\":\"C. Helmstetter, Olivier Ponsini\",\"doi\":\"10.1109/MEMCOD.2008.4547687\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The development of complex systems mixing hardware and software starts more and more by the design of functional models written in SystemC/TLM. These models are used as golden models for embedded software validation and for hardware verification, therefore their own validation is an important issue. One thriving approach consists in describing the semantics of SystemC/TLM in a formal language for which a verification tool exists. In this paper, we use Lotos and the CADP toolbox as a unifying framework to define and experiment with two possible semantics for untimed SystemC/TLM, emphasizing either the nonpreemptive semantics of SystemC or the concurrent one of TIM. We also discuss and illustrate on a benchmark the qualitative versus quantitative performance trade-off offered by each semantics as regards verification. When associated with locks, our concurrent semantics appears both to provide more flexibility and to improve the scalability.\",\"PeriodicalId\":221804,\"journal\":{\"name\":\"2008 6th ACM/IEEE International Conference on Formal Methods and Models for Co-Design\",\"volume\":\"103 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 6th ACM/IEEE International Conference on Formal Methods and Models for Co-Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MEMCOD.2008.4547687\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 6th ACM/IEEE International Conference on Formal Methods and Models for Co-Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MEMCOD.2008.4547687","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 21

摘要

硬件和软件混合的复杂系统的开发越来越多地从用SystemC/TLM编写功能模型的设计开始。这些模型被用作嵌入式软件验证和硬件验证的黄金模型，因此它们自身的验证是一个重要的问题。一种流行的方法是用存在验证工具的形式语言描述SystemC/TLM的语义。在本文中，我们使用Lotos和CADP工具箱作为一个统一的框架来定义和实验两种可能的非定时SystemC/TLM语义，强调SystemC的非抢占语义或TIM的并发语义。我们还在基准上讨论并说明了每种语义在验证方面提供的定性与定量性能权衡。当与锁相关联时，我们的并发语义似乎既提供了更大的灵活性，又提高了可伸缩性。

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

查看原文本刊更多论文

A Comparison of Two SystemC/TLM Semantics for Formal Verification

The development of complex systems mixing hardware and software starts more and more by the design of functional models written in SystemC/TLM. These models are used as golden models for embedded software validation and for hardware verification, therefore their own validation is an important issue. One thriving approach consists in describing the semantics of SystemC/TLM in a formal language for which a verification tool exists. In this paper, we use Lotos and the CADP toolbox as a unifying framework to define and experiment with two possible semantics for untimed SystemC/TLM, emphasizing either the nonpreemptive semantics of SystemC or the concurrent one of TIM. We also discuss and illustrate on a benchmark the qualitative versus quantitative performance trade-off offered by each semantics as regards verification. When associated with locks, our concurrent semantics appears both to provide more flexibility and to improve the scalability.

求助全文

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

来源期刊

2008 6th ACM/IEEE International Conference on Formal Methods and Models for Co-Design

自引率

0.00%

发文量