Verifying protocols by model checking: a case study of the wireless application protocol and the model checker SPIN
暂无分享,去创建一个
[1] Ryszard Janicki,et al. Verification of the WAP transaction layer , 2004, Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004..
[2] Davor Obradovic,et al. Formal Analysis of Convergence of Routing Protocols , 2000 .
[3] Steven Gordon. Verification of the WAP Transaction Layer using Coloured Petri Nets , 2001 .
[4] Ryszard Janicki,et al. On a formal semantics of tabular expressions , 2001, Sci. Comput. Program..
[5] Gerard J. Holzmann,et al. The Model Checker SPIN , 1997, IEEE Trans. Software Eng..
[6] Edmund M. Clarke,et al. Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..
[7] Maciej Koutny,et al. Structure of Concurrency , 1991, Theor. Comput. Sci..
[8] Theodorus Cornelis Ruys,et al. Towards effective model checking , 2001 .
[9] Ahmed Serhrouchni,et al. Creating implementations from Promela models , 1996, The Spin Verification System.
[10] Gerard J. Holzmann,et al. Design and validation of computer protocols , 1991 .
[11] C. R. Ramakrishnan,et al. Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools , 1999, TACAS.
[12] Karsten Stahl,et al. Divide, Abstract, and Model-Check , 1999, SPIN.
[13] George S. Avrunin,et al. Patterns in property specifications for finite-state verification , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).
[14] Shin Nakajima,et al. The SPIN Model Checker : Primer and Reference Manual , 2004 .