基于CCS的组合硬件系统验证

1991., International Workshop on the HOL Theorem Proving System and Its Applications Pub Date : 1991-08-28 DOI:10.1109/HOL.1991.596276

E. T. Schubert

{"title":"基于CCS的组合硬件系统验证","authors":"E. T. Schubert","doi":"10.1109/HOL.1991.596276","DOIUrl":null,"url":null,"abstract":"This paper describes extensions to the interpreter model for verifying a system of (independently verified) components. We propose using a process algebra to specify and reason about the requirements of composed systems. An example is presented to demonstrate how the system synchronization requirements can be specified using CCS. Preliminary work to embed a simple finite sequence variation of CCS within HOL is also presented.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Verification Of Composed Hardware Systems Using CCS\",\"authors\":\"E. T. Schubert\",\"doi\":\"10.1109/HOL.1991.596276\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes extensions to the interpreter model for verifying a system of (independently verified) components. We propose using a process algebra to specify and reason about the requirements of composed systems. An example is presented to demonstrate how the system synchronization requirements can be specified using CCS. Preliminary work to embed a simple finite sequence variation of CCS within HOL is also presented.\",\"PeriodicalId\":213603,\"journal\":{\"name\":\"1991., International Workshop on the HOL Theorem Proving System and Its Applications\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-08-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1991., International Workshop on the HOL Theorem Proving System and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HOL.1991.596276\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HOL.1991.596276","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文描述了解释器模型的扩展，用于验证(独立验证)组件的系统。我们建议使用过程代数来指定和推理组合系统的需求。通过实例说明了如何使用CCS来指定系统同步需求。本文还介绍了在HOL中嵌入CCS的简单有限序列变化的初步工作。

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

查看原文本刊更多论文

Verification Of Composed Hardware Systems Using CCS

This paper describes extensions to the interpreter model for verifying a system of (independently verified) components. We propose using a process algebra to specify and reason about the requirements of composed systems. An example is presented to demonstrate how the system synchronization requirements can be specified using CCS. Preliminary work to embed a simple finite sequence variation of CCS within HOL is also presented.

求助全文

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

来源期刊

1991., International Workshop on the HOL Theorem Proving System and Its Applications

自引率

0.00%

发文量