安全协议状态空间构造的BSP算法

Infinity Pub Date : 2010-09-30 DOI:10.1109/PDMC-HIBI.2010.14

F. Gava, Michaël Guedj, F. Pommereau

{"title":"安全协议状态空间构造的BSP算法","authors":"F. Gava, Michaël Guedj, F. Pommereau","doi":"10.1109/PDMC-HIBI.2010.14","DOIUrl":null,"url":null,"abstract":"This paper presents a Bulk-Synchronous Parallel (BSP) algorithm to compute the discrete state space of structured models of security protocols. The BSP model of parallelism avoids concurrency related problems (mainly deadlocks and non-determinism) and allows us to design an efficient algorithm that is at the same time simple to express. A prototype implementation has been developed, allowing to run benchmarks showing the benefits of our algorithm.","PeriodicalId":31175,"journal":{"name":"Infinity","volume":"21 1","pages":"37-44"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"A BSP Algorithm for the State Space Construction of Security Protocols\",\"authors\":\"F. Gava, Michaël Guedj, F. Pommereau\",\"doi\":\"10.1109/PDMC-HIBI.2010.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a Bulk-Synchronous Parallel (BSP) algorithm to compute the discrete state space of structured models of security protocols. The BSP model of parallelism avoids concurrency related problems (mainly deadlocks and non-determinism) and allows us to design an efficient algorithm that is at the same time simple to express. A prototype implementation has been developed, allowing to run benchmarks showing the benefits of our algorithm.\",\"PeriodicalId\":31175,\"journal\":{\"name\":\"Infinity\",\"volume\":\"21 1\",\"pages\":\"37-44\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Infinity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDMC-HIBI.2010.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Infinity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDMC-HIBI.2010.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 13

摘要

提出了一种计算安全协议结构模型离散状态空间的批量同步并行(BSP)算法。并行性的BSP模型避免了并发相关的问题(主要是死锁和非确定性)，并允许我们设计一个高效的算法，同时又易于表达。已经开发了一个原型实现，允许运行基准测试，以显示我们算法的优点。

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

查看原文本刊更多论文

A BSP Algorithm for the State Space Construction of Security Protocols

This paper presents a Bulk-Synchronous Parallel (BSP) algorithm to compute the discrete state space of structured models of security protocols. The BSP model of parallelism avoids concurrency related problems (mainly deadlocks and non-determinism) and allows us to design an efficient algorithm that is at the same time simple to express. A prototype implementation has been developed, allowing to run benchmarks showing the benefits of our algorithm.

求助全文

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

来源期刊

Infinity

CiteScore

2.30

自引率

0.00%

发文量

审稿时长

10 weeks