arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2207.09895cs.LO
收藏

PFMC:一个用于安全协议验证的并行符号模型检验器

PFMC: a parallel symbolic model checker for security protocol verification

Alex James, Alwen Tiu, Nisansala Yatapanage

摘要:

我们提出了一个调查的安全协议验证,是基于一个符号模型的对手,具体的条款和消息的实例化,直到需要解决一个特定的断言的并行模型检查器的设计和实现。我们建议建立在这种自然懒惰的方法来并行化这种象征性的状态探索和评估。我们利用Haskell中的策略概念,它从线程管理的低级别细节中抽象出来,并模块化地添加并行评估策略(在Haskell中封装为monad)。我们建立在一个现有的符号模型检查器,OFMC,这是已经在Haskell中实现。我们表明,有一个非常显着的速度提高了约3-5倍的改进时,从原来的单线程实现OFMC到我们的多线程版本,Dolev-Yao攻击者模型和更一般的代数攻击者模型。我们确定了几个问题,在并行化的模型检查器:除其他外,控制内存消耗的增长,平衡懒惰与严格的评价,并实现最佳的并行粒度。

英文摘要:

We present an investigation into the design and implementation of a parallel model checker for security protocol verification that is based on a symbolic model of the adversary, where instantiations of concrete terms and messages are avoided until needed to resolve a particular assertion. We propose to build on this naturally lazy approach to parallelise this symbolic state exploration and evaluation. We utilise the concept of strategies in Haskell, which abstracts away from the low-level details of thread management and modularly adds parallel evaluation strategies (encapsulated as a monad in Haskell). We build on an existing symbolic model checker, OFMC, which is already implemented in Haskell. We show that there is a very significant speed up of around 3-5 times improvement when moving from the original single-threaded implementation of OFMC to our multi-threaded version, for both the Dolev-Yao attacker model and more general algebraic attacker models. We identify several issues in parallelising the model checker: among others, controlling growth of memory consumption, balancing lazy vs strict evaluation, and achieving an optimal granularity of parallelism.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑