研究生: |
徐志文 Zhi-Wen Hsu |
---|---|
論文名稱: |
ArCats局部性模型分析安全性質和活化性質 Compositional Model Checking Safety and Liveness Properties in ARCATS |
指導教授: |
鄭永斌
Cheng, Yung-Pin |
學位類別: |
碩士 Master |
系所名稱: |
資訊工程學系 Department of Computer Science and Information Engineering |
論文出版年: | 2006 |
畢業學年度: | 94 |
語文別: | 中文 |
論文頁數: | 79 |
中文關鍵詞: | 局部性分析 、ARCATS 、安全性質 、活化性質 、模型驗證 |
英文關鍵詞: | Compositional Analysis, Safety Property, Liveness Property, Model Checking, ARCATS |
論文種類: | 學術論文 |
相關次數: | 點閱:300 下載:4 |
分享至: |
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
近年來,局部性模型分析在自動化軟體驗證領域中佔有一席角色。局部性模型分析能夠成功的關鍵在於檢驗的系統模型具有良好的階層架構,同時盡量利用最小化的技術減化子系統的內部行為,達到減緩組態爆炸的發生。透過模型架構重構可以解決不良的模型架構,這增強局部性分析的效能。當利用局部性分析檢驗系統性質時,因為保留過多的系統性質到全域系統中,造成子系統無法最小化的結果,這將大幅消減局部性分析在模型驗證中的效能。
在本篇論文中,我們根據ArCats和其在局部性分析中所提供的良好功能,開發出能夠檢測系統安全性質(safety)和活化性質(liveness)的功能,同時並能夠維持局部性分析的減緩狀態爆炸的優勢。在檢驗安全性質時,我們利用一種類似死結狀態的π狀態,讓違反安全性的系統行為能夠被偵測出來。而在檢驗活化性質時我們使用一種特殊的接受轉移(accept transition)來代表系統符合檢驗性質。這兩種在局部性分析中檢測性質,主要參考Cheung[28][29][30]的研究。但是由於ArCats是以CCS為基礎來提供模型架構重構的功能而Cheung的研究採用的是CSP,本篇論文將針對如何利用以CSP為基礎的驗證技術實做到以CCS為基礎的驗證工具中,同時探討與解決所面臨的困難。
In recent years, compositional model checking is known as a promising approach to combat state explosion problem in the automatic verification techniques. However, the success of such technique relies on a good hierarchy in system architectures so that the states in subsystemscan be minimized and hidden to alleviate state explosion problem. ARCATS is a tool designed for compositional analysis. It provides a technique called model architecture refactoring to address systems which do not possess good compositional hierarchies in their as-built architecture.
In the past, ARCATS can detect deadlocks only. In this thesis, we would like to improve ARCATS to allow safety and liveness properties to be verified in a compositional fashion. To check safety properties, a violation of safety properties is caught as a π state in the system behavior. A π state is very similar to a deadlock state. To check liveness properties, a special global transition called accept transition is added to Buchi automata which represents the liveness properties. These approaches have been proposed in Cheung[28][29][30], which is based on CSP, but we need to implement these approaches in to ARCATS, which is based on CCS. There are several issues to be addressed in this implementation. These issues will be discussed in this thesis.
Alessandro Cimatti , Edmund M. Clarke , Ofer Strichman , Yunshan Zhu . Bounded Model Checking . ACM 2003.
[3] Bharadwaj R. and Heitmeyer C. . Model checking complete requirements specifications using abstraction. Rep. NRL/MR5540-97-7999. Information Technology Division,Naval Research Laboratory, Washington, DC .1997.
[4] C.A.R. Hoare . Communicating Sequential Processes . Prentice-Hall International Series in Computer Science. Pretice-Hall, Inc. , Upper Saddle River, NJ. 1985
[5] Carl A .Sunshine ,editor . Communication Protocol Modeling . Artech House , Dedham , MA , 1981 .
[6] Corbett , James C . Evaluating deadlock detection methods for concurrent software. IEEE Transactions on Software Engineering , 2(3):161-180 ,March .
[7] E. Allen Emerson. Handbook of theoretical computer science , chapter Temporal and model logic , page 997-1071 . Elsevier Science Publishers B.V.,1990 .
62
[8] Edmund M. Clarke and E. Allen Emerson. Synthesis of synchronization skeletons for branching time temporal logic. In Workshop on logic of Programs, volume 131 of Lecture Notes in Computer Science , Yorktown heights, N.Y.,1981
[9] E. M. Clarke , E. A. Emerson , and A. P. Sistla. Automatic verification of finite-state concurrent system using temporal logic. ACM Transactions on Programming Languages and Systems,8(2):244-263,April 1986.
[10] G. J. Holzmann , The model checker SPIN . IEEE Transaction on Software Enginering ,Volume 23 , Issue 5 : 279-295,May 1997 .
[11] G. R. Andrews, Concurrent Programming – Principles and Practice : The Benjamin/Cummings Publishing Company Ltd.,1991.
[12] Gian-Luigi Ferrari , Stefania Gnesi , Isti-C.N.R.Pisa ,Marco Pistore . A model-checking Verification Environment for Mobile Processes. ACM 2003.
[13] Helmbold , D. and Luckham , D . Debugging Ada tasking programs. IEEE Software. 2,2(Mar),47-57 , 1985 .
[14] Hong-Yi Wang master thesis . On-the-fly Bisimulation Minimization in Compositional Analysis. NTNU 2005.
[15] J. C. Lin and S. Paul ,”RMTP : A Reliable Multicast Transport protocol ” ,presented at IEEE INFOCOMM’96 , San Francisco , California , March 1996
63
[16] K.K. Sabnani , Lapone , A. M. ,and M. U. Uyar , 1989 . An algorithmic procedure for checking safety properties of protocols . IEEE Trans. Commun.37,9(Sept.),940-948 . 1989
[17] Larsen. K. and Milner , R. . Verifying a protocol using relativized bisimulation. In proceedings of the 14th International Colloquium on Automata language and Programming. 1987.
[18] Madelaine, E. and Simone, R. de. The FC2 reference Manual . http://www-sop.inria.fr/meije/verification/doc.html ,INRIA.
[19] Malhotra J. Smolka, S. A. Giacalone and Shapir R. A tool for hierarchical design and simulation of concurrent systems . In Proceedings of the BCS-FACS Workshop on Specification and Verification of Concurrent Systems ,1988 .
[20] Milner, R. Communication and ConCurrency . Prentice Hall 1989 .
[21] N. Francez. Program verification. International Computer Science. Addison-Weflay , 1992 .
[22] Nina Amila , Xiaoqun Du, Andreas Kuehlmann, Robert P. Kurshan and Kenneth L. McMillan .An Analysis of SAT-based Model Checking Techniques in an Industrial Environment . ACM 2005.
[23] Orna Kupferman and Moshe Y. Vardi . Model Checking of Safety
64
Properties .ACM , 2001 .
[24] R. E. Bryant. Graph-based algorithms for Boolean function manipulations. IEEE Transactions on Computers , 1986 .
[25] Rob J. Van Glabbeek and W.Peter Weijland . Branching time and abstraction in bisimulation semantics ( extended abstract ). In information processing 89 , G Ritter,ed., North-Holland , pp.613-618, 1989 .
[26] Rob J. Van Glabbeek and W.Peter Weijland . Branching time and abstraction in bisimulation semantics . Journal of the ACM 43(3),pp.555-600 ,1996.
[27] Shing Chi Cheung ,and Jeff Kramer . Context Constraints for Compositional Reachability Analysis . ACM 1996.
[28] Shing Chi Cheung ,and Jeff Kramer . Checking Subsystem Safety Properties in Compositional Reachability Analysis . IEEE Proceedings of ICSE-18 ,1996 .
[29] Shing Chi Cheung ,and Jeff Kramer. Checking Safety Property Using Compositional Reachability Analysis . ACM Transaction on Software Engineering and Methodology ,Vol.8,No.1 ,January 1999.
[30] Shing Chi Cheung , Dimitra Giannakopoulou , and Jeff Kramer . Verification of Liveness Properties Using Compositional Reachability Analysis .ACM SIGSOFT 1999
65
[31] Stephan merz . Model Checking: A Tutorial Overview .ACM, 2001
[32] Wei Jen Yeh , Michal Young .Compositional Reachability Analysis Using Process Algebra . ACM 1991.
[33] Yung-Pin Cheng . Towards Scalable Compositional Analysis by Refactoring Design Models. proceedings of the ACM SIGSOFT 2003 Symposium on the Foundations of Software Engineering(FSE2003).
[34] Yung-Pin Cheng . Refactoring Design Models for Inductive Verification . Proceedings of the ACM SIGSOFT 2002 International Symposium on Software Testing and Analysis. (ISSTA2002) Rome, Italy, July 22-24, 2002.
[35] Yung-Pin Cheng . The ArCats reference. http://www.ice.ntnu.edu.tw/~ypc/ArCats.htm
[36] Yu-ju Cheng master thesis. Explicit Compositional State-Space Enumeration with Context Constraint & Counter Examples by Hierarchical Tracing . NTNU 2005.