用于并发分析的任务交互图

[1988] Proceedings. Second Workshop on Software Testing, Verification, and Analysis Pub Date : 1988-07-19 DOI:10.1109/WST.1988.5366

Douglas L. Long, Lori A. Clarke

{"title":"用于并发分析的任务交互图","authors":"Douglas L. Long, Lori A. Clarke","doi":"10.1109/WST.1988.5366","DOIUrl":null,"url":null,"abstract":"The authors present a representation for concurrent systems, called a task interaction graph, that facilitates analysis. They have developed a model of interacting tasks that can considerably reduce the number of states in concurrency graph representations. They call this representation a task interaction concurrency graph (TIGC), since it is derived from a task interaction graph (TIG) instead of from a control-flow representation. Using their model, the authors have compared the resulting representations for some of the common concurrency examples that appear in the literature. For these examples, the number of states were reduced by well over 50%. Such a substantial reduction is expected to have a major impact on the kinds of analysis that can be applied and on the kinds of programs that can be analyzed.<<ETX>>","PeriodicalId":269073,"journal":{"name":"[1988] Proceedings. Second Workshop on Software Testing, Verification, and Analysis","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Task interaction graphs for concurrency analysis\",\"authors\":\"Douglas L. Long, Lori A. Clarke\",\"doi\":\"10.1109/WST.1988.5366\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present a representation for concurrent systems, called a task interaction graph, that facilitates analysis. They have developed a model of interacting tasks that can considerably reduce the number of states in concurrency graph representations. They call this representation a task interaction concurrency graph (TIGC), since it is derived from a task interaction graph (TIG) instead of from a control-flow representation. Using their model, the authors have compared the resulting representations for some of the common concurrency examples that appear in the literature. For these examples, the number of states were reduced by well over 50%. Such a substantial reduction is expected to have a major impact on the kinds of analysis that can be applied and on the kinds of programs that can be analyzed.<<ETX>>\",\"PeriodicalId\":269073,\"journal\":{\"name\":\"[1988] Proceedings. Second Workshop on Software Testing, Verification, and Analysis\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-07-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings. Second Workshop on Software Testing, Verification, and Analysis\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WST.1988.5366\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. Second Workshop on Software Testing, Verification, and Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WST.1988.5366","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

作者提出了一种并行系统的表示，称为任务交互图，便于分析。他们开发了一个交互任务模型，可以大大减少并发图表示中的状态数量。他们将这种表示称为任务交互并发图(TIGC)，因为它派生自任务交互图(TIG)，而不是控制流表示。使用他们的模型，作者比较了文献中出现的一些常见并发示例的结果表示。对于这些例子，州的数量减少了50%以上。如此大幅度的减少预计将对可应用的分析种类和可分析的程序种类产生重大影响

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

查看原文本刊更多论文

Task interaction graphs for concurrency analysis

The authors present a representation for concurrent systems, called a task interaction graph, that facilitates analysis. They have developed a model of interacting tasks that can considerably reduce the number of states in concurrency graph representations. They call this representation a task interaction concurrency graph (TIGC), since it is derived from a task interaction graph (TIG) instead of from a control-flow representation. Using their model, the authors have compared the resulting representations for some of the common concurrency examples that appear in the literature. For these examples, the number of states were reduced by well over 50%. Such a substantial reduction is expected to have a major impact on the kinds of analysis that can be applied and on the kinds of programs that can be analyzed.<>

求助全文

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

来源期刊

[1988] Proceedings. Second Workshop on Software Testing, Verification, and Analysis

自引率

0.00%

发文量