两个被广泛使用的Model Checking工具

最新推荐文章于 2023-06-15 20:17:08 发布
最新推荐文章于 2023-06-15 20:17:08 发布
阅读量1.5k 收藏
点赞数
分类专栏： 论文点评 文章标签： 工具 testing dependencies components generation tools
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/qysh123/article/details/7378753
版权

最近看论文的时候，发现和软件分析、测试及模型检验相关的论文，都会引用两个Model Checking工具，分别是：

BLAST: http://mtc.epfl.ch/software-tools/blast/index-epfl.php/
SLAM: http://research.microsoft.com/en-us/projects/slam/

和这两个工具相关几篇主要论文，引用次数都很多，下面举几个例子：

“Software model checking tools, like SLAM [1] and Blast [2], ……”
——C. Y. Cho, D. Babi, P. Poosankam, K. Z. Chen, E. X. Wu, and D. Song, "MACE: model-inference-assisted concolic exploration for protocol and vulnerability discovery," in Proceedings of the 20th USENIX conference on Security, San Francisco, CA, 2011, p. 10-10.


“Two popular software model checker, BLAST and SLAM, have also been used for generating test inputs with the goal of covering a specific predicate or a combination of predicates [3, 4]”

——C. S. P, S, Reanu, P. C. Mehlitz, D. H. Bushnell, K. Gundy-Burlet, M. Lowry, S. Person, and M. Pape, "Combining unit-level symbolic execution and system-level concrete execution for testing nasa software," in Proceedings of the 2008 international symposium on Software testing and analysis, Seattle, WA, USA, 2008, pp. 15-26.


“most software model checkers [1, 5] do not offer control-flow (path) abstractions”

——R. Santelices and M. J. Harrold, "Exploiting program dependencies for scalable multiple-path symbolic execution," in Proceedings of the 19th international symposium on Software testing and analysis, Trento, Italy, 2010, pp. 195-206.

参考文献：

[1] T. Ball, R. Majumdar, T. Millstein, and S. K. Rajamani, "Automatic predicate abstraction of C programs," in Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation, Snowbird, Utah, United States, 2001, pp. 203-213.

[2] T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre, "Software verification with BLAST," in Proceedings of the 10th international conference on Model checking software, Portland, OR, USA, 2003, pp. 235-239.

[3] D. Beyer, A. J. Chlipala and R. Majumdar, "Generating Tests from Counterexamples," in Proceedings of the 26th International Conference on Software Engineering, 2004, pp. 326-335.

[4] T. Ball, "A theory of predicate-complete test coverage and generation," in Proceedings of the Third international conference on Formal Methods for Components and Objects, Leiden, The Netherlands, 2005, pp. 1-22.

[5] D. Beyer, T. A. Henzinger, R. Jhala, and R. Majumdar, "The software model checker Blast: Applications to software engineering," Int. J. Softw. Tools Technol. Transf., vol. 9, pp. 505-525, 2007.

参考文献1在Google Schoolar中的引用次数为648次，参考文献2的引用次数为364次（引用次数为2012年3月21日数据），这两个工具的影响力可见一斑。

蛐蛐蛐
关注
专栏目录
Software Model Checking
08-07
Tutorial: Abstract. We survey principles of model checking techniques for the automatic analysis of reactive systems. The use of model checking is exemplified by an analysis of the Needham-Schroeder public key protocol. We then formally define transition systems, temporal logic, !-automata, and their relationship. Basic model checking algorithms for linear- and branching-time temporal logics are defined, followed by an introduction to symbolic model checking and partial-order reduction techniques. The paper ends with a list of references to some more advanced topics.
模型检测model checking
02-20 2139
一、基本概念 模型检测(model checking)是一种很重要的自动验证技术。它最早由Clarke和Emerson以及Quielle和Sifakis在1981年分别提出的,主要通过显式状态搜索或隐式不动点计算来验证有穷状态并发系统的模态/命题性质。由于模型检测可以自动执行,并能在系统不满足性质时提供反例路径,因此在工业界比演绎证明更受推崇。尽管限制在有穷系统上是一个缺点,但模型检查可以应
程序形式化验证之——谓词抽象技术
q1uTruth的博客
09-29 561
旨在自动化地证明程序的正确性，即程序在运行的过程中不会出错（从坏的方面），并且程序的功能可以被满足（功能正确性）。程序验证>形式化方法>模型检测模型检测Model Checking是形式化方法（formal method）的一种。主要思想是对系统的全局空间进行搜索，验证是否满足相关规范。对于已发布的程序有bug，可以通过编译但运行时出错，把软件错误控制在运行之前、运行早期，不要发生在生产环境。
model-checking
zlstone2010的专栏
02-23 575
 model checking 模型检测是针对一个模型的测试。 具体的测试，是对模型执行的实例的一种测试。模型测试更加抽象。 状态空间  剪枝 Model checking is a method for formally verifying finite-state concurrent systems. Specifications about the syst
model checking
05-21
模型检测ppt， 理论，工具和其它相关介绍，
Principles of Model Checking
06-06
死锁是并发系统中常见的一个问题，指两个或多个进程在等待彼此持有的资源而不释放自己的资源，导致所有进程都陷入无限等待的状态。书中详细解释了死锁的成因和检测方法，这对于预防和解决死锁问题具有重要意义。 ##...
Model Checking
dogman_的博客
11-24 105
模型检验What is that1) GM不满足时,会发生什么总的来说:why:2) 如何检验该模型是否满足假设3) 当不满足时,我们可以做些什么 What is that 之前所有的回归模型及性质都是基于GM假设的:  E(ϵi)=0E(\epsilon_i)=0E(ϵi​)=0 i=1,2..n_{i=1,2..n}i=1,2..n​  Var(ϵi)=σ2Var(\epsilon_i)=\sigma^2Var(ϵi​)=σ2 i=1,2..n_{i=1,2..n}i=1,2..n​   ϵ1,ϵ2.
Model Checking(模型检测)
最新发布
qingmuluoyang的博客
06-15 668
软件工程；model checking
Model Checking for CTL（一）
BeyondWang的博客
09-05 1739
1.1Reliability Computations 1.1.1Reliability of serial systems 有n个串行组件，R1...Rn表示其可靠性，则系统可靠性Rs=R1*R2*...Rn。 1.1.2Reliability of parallel systems 有n个并行组件，R1...Rn表示其可靠性，则系统可靠性如下： 因为其假设为n个组件中，有一个能工...
LTL – model checking
06-22
model checking 的ppt，应该有帮助的
Model Checking 模式检测（英文版）
04-08
本人在国外的必修课课件，非常详尽的讲述了模式检测的原理和数学基础，是可计算性与复杂度分析的重要组成部分。
Handbook of Model Checking
06-03
Model checking is a computer-assisted method for the analysis of dynamical systems that can be modeled by state-transition systems. Drawing from research traditions in mathematical logic, programming languages, hardware design, and theoretical computer science, model checking is now widely used for the verification of hardware and software in industry. This chapter is an introduction and short survey of model checking. The chapter aims to motivate and link the individual chapters of the handbook, and to provide context for readers who are not familiar with model checking.
Model Checking for CTL（二）
BeyondWang的博客
09-05 678
2.4 Model checking algorithms for CTL 2.4.1 Existential Normal Form 所有CLT公式都可以用“存在”形式来表达。 ∀XΦ = ¬∃X¬Φ ∀(Φ U Ψ) = ¬∃(¬Ψ U (¬Φ ∧ ¬Ψ)) ∧ ¬∃
Model checking Part I
07-06 846
Model Checking 文章目录Model Checking序言可靠系统开发过程中的主要挑战—设计验证问题（design validation）现有实践方法—模拟和测试（simulation and tesing）本书主题：取代现有的方法—形式验证（formal verification）本书焦点：形式验证方法中的其中一种—模型检测（model checking）第一章：第一版简介模型检测的历史模型检测的现状第二版介绍第二章：第二版简介模型检测本章主要内容2.1 形式化方法的必要性2.2 硬件和软件检
Model Checking-Edmund M. Clarke-模型检查PDF
06-23
Model checking is a technique for verifying finite state concurrent systems such as sequential circuit designs and communication protocols. It has a number of advantages over traditional approaches that are based on simulation, testing, and deductive reasoning. In particular, model checking is automatic and usually quite fast. Also, if the design contains an error, model checking will produce a counterexample that can be used to pinpoint the source of the error. The method, which was awarded the 1998 ACM Paris Kanellakis Award for Theory and Practice, has been used successfully in practice to verify real industrial designs, and companies are beginning to market commercial model checkers. The main challenge in model checking is dealing with the state space explosion problem. This problem occurs in systems with many components that can interact with each other or systems with data structures that can assume many different values. In such cases the number of global states can be enormous. Researchers have made considerable progress on this problem over the last ten years. This is the first comprehensive presentation of the theory and practice of model checking. The book, which includes basic as well as state-of-the-art techniques, algorithms, and tools, can be used both as an introduction to the subject and as a reference for researchers. About the Authors Edmund M. Clarke, a pioneer of the automated method called Model Checking, is FORE Systems Professor of Computer Science and Professor of Electrical and Computer Engineering at Carnegie Mellon University, and a winner of the 2007 Turing Award given by the Association for Computing Machinery. Doron Peled is Professor of Computer Science at the University of Warwick, Coventry, UK. Endorsements "Model Checking is bound to be the pre-eminent source for research, teaching, and industrial practice on this important subject. The authors include the foremost experts. This is the first truly comprehensive treatment of a line of research that has gone from conception to industrial practice in only two decades." —R. P. Kurshan, Distinguished Member Technical Staff, Bell Laboratories
模型检测Model Checking---学习记录（二）系统建模
ziigea的博客
11-26 1002
文章目录系统建模一阶逻辑表示法 系统建模 设AP是一组原子命题，即对变量，常量和谓词符号的布尔表达式。 Clarke等人在AP上定义Kripke结构为4元组M =（S，I，R，L）由…组成 一组有限的状态S. 一组初始状态I⊆S. 完全变迁关系R⊆S×S，即∀s∈S∃s’∈S使得（s，s’）∈R。 L：S→2AP是标记函数，它标识在该状态下为真的原子命题集合。 由于R是左总数，因此总是可以通过...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值