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

最近看论文的时候,发现和软件分析、测试及模型检验相关的论文,都会引用两个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日数据),这两个工具的影响力可见一斑。

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
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值