Industrial Strength Distributed Explicit State Model Checking

Infinity Pub Date : 2010-09-30 DOI:10.1109/PDMC-HIBI.2010.13
B. Bingham, Jesse D. Bingham, F. M. D. Paula, John Erickson, Gaurav Singh, Mark Reitblatt
{"title":"Industrial Strength Distributed Explicit State Model Checking","authors":"B. Bingham, Jesse D. Bingham, F. M. D. Paula, John Erickson, Gaurav Singh, Mark Reitblatt","doi":"10.1109/PDMC-HIBI.2010.13","DOIUrl":null,"url":null,"abstract":"We present Preach, an industrial strength distributed explicit state model checker based on Murphi. The goal of this project was to develop a reliable, easy to maintain, scalable model checker that was compatible with the Murphi specification language. Preach is implemented in the concurrent functional language Erlang, chosen for its parallel programming elegance. We use the original Murphifront-end to parse the model description, a layer written in Erlang to handle the communication aspects of the algorithm, and also use Murphias a back-end for state expansion and to store the hash table. This allowed a clean and simple implementation, with the core parallel algorithms written in under 1000 lines of code. This paper describes the Preach implementation including the various features that are necessary for the large models we target. We have used Preach to model check an industrial cache coherence protocol with approximately 30 billion states. To our knowledge, this is the largest number published for a distributed explicit state model checker. Preach has been released to the public under an open source BSD license.","PeriodicalId":31175,"journal":{"name":"Infinity","volume":"53 1","pages":"28-36"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"53","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Infinity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDMC-HIBI.2010.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 53

Abstract

We present Preach, an industrial strength distributed explicit state model checker based on Murphi. The goal of this project was to develop a reliable, easy to maintain, scalable model checker that was compatible with the Murphi specification language. Preach is implemented in the concurrent functional language Erlang, chosen for its parallel programming elegance. We use the original Murphifront-end to parse the model description, a layer written in Erlang to handle the communication aspects of the algorithm, and also use Murphias a back-end for state expansion and to store the hash table. This allowed a clean and simple implementation, with the core parallel algorithms written in under 1000 lines of code. This paper describes the Preach implementation including the various features that are necessary for the large models we target. We have used Preach to model check an industrial cache coherence protocol with approximately 30 billion states. To our knowledge, this is the largest number published for a distributed explicit state model checker. Preach has been released to the public under an open source BSD license.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
工业强度分布式显式状态模型检查
提出了基于Murphi的工业强度分布式显式状态模型检查器传道。这个项目的目标是开发一个可靠的、易于维护的、可伸缩的、与Murphi规范语言兼容的模型检查器。宣讲是用并发函数语言Erlang实现的,选择Erlang是因为其并行编程的优雅性。我们使用原始的murphi前端来解析模型描述,一个用Erlang编写的层来处理算法的通信方面,并且还使用murphi前端作为状态扩展和存储哈希表的后端。这允许一个干净和简单的实现,核心并行算法编写在1000行以下的代码。本文描述了包括我们所瞄准的大型模型所需的各种特性在内的传道实现。我们已经使用说教来模型检查一个工业缓存一致性协议大约有300亿个状态。据我们所知,这是分布式显式状态模型检查器发布的最大数量。在开源BSD许可下,布道已经向公众发布。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.30
自引率
0.00%
发文量
26
审稿时长
10 weeks
期刊最新文献
Sistem Informasi Perpustakaan Pada SMKN 3 Tana Toraja Dengan Metode Rapid Application Development (RAD) Perancangan Sistem Informasi Paket Wisata Berbasis Web Studi Kasus Sarira Trip Penggunaan YOLOv4 Untuk Menentukan Lokasi Dosen Dan Mahasiswa Dengan Menggunakan CCTV Aplikasi Reservasi Pantan Toraja Hotel Prediksi Persediaan Sepeda Motor Pada Dealer Yamaha Jaya Baru Motor Mengunakan Metode Frequent Pattern (FF-Growth)
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1