Fun with FireWire: A Comparative Study of Formal Verification Methods Applied to the IEEE 1394 Root Contention Protocol
暂无分享,去创建一个
[1] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..
[2] Andrea Bianco,et al. Model Checking of Probabalistic and Nondeterministic Systems , 1995, FSTTCS.
[3] Nancy A. Lynch,et al. Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..
[4] Hans Toetenel,et al. Parametric verification of the IEEE 1394a Root Contention protocol using LPMC , 2000, Proceedings Seventh International Conference on Real-Time Computing Systems and Applications.
[5] L. D. Alfaro. The Verification of Probabilistic Systems Under Memoryless Partial-Information Policies is Hard , 1999 .
[6] Carroll Morgan,et al. pGCL: formal reasoning for random algorithms , 1998 .
[7] Thomas A. Henzinger,et al. Parametric real-time reasoning , 1993, STOC.
[8] Thomas A. Henzinger,et al. HYTECH: a model checker for hybrid systems , 1997, International Journal on Software Tools for Technology Transfer.
[9] C. Shankland,et al. Time , E-LOTOS , and the FireWire , 1999 .
[10] Mihaela Sighireanu,et al. Parameterized Reachability Analysis of the IEEE 1394 Root Contention Protocol using TReX , 2001 .
[11] Marta Z. Kwiatkowska,et al. PRISM: Probabilistic Symbolic Model Checker , 2002, Computer Performance Evaluation / TOOLS.
[12] Hans Toetenel,et al. Application of parametric model checking - the Root Contention protocol , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.
[13] Luca de Alfaro,et al. Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation , 2000, TACAS.
[14] Judi Romijn,et al. Fun with FireWire: Experiences with Verifying the IEEE 1394 Root Contention Protocol , 2001 .
[15] Pedro R. D'Argenio,et al. Algebras and Automata for Timed and Stochastic Systems , 1999 .
[16] Colin J. Fidge,et al. But What if I Don't Want to Wait Forever? , 2003, Formal Aspects of Computing.
[17] Ahmed Bouajjani,et al. TReX: A Tool for Reachability Analysis of Complex Systems , 2001, CAV.
[18] Savi Maharaj,et al. A Survey of Formal Methods Applied to Leader Election in IEEE 1394 , 2000, J. Univers. Comput. Sci..
[19] Frits W. Vaandrager,et al. Root Contention in IEEE 1394 , 1999, ARTS.
[20] Roberto Segala,et al. Modeling and verification of randomized distributed real-time systems , 1996 .
[21] M.I.A. Stoelinga. Gambling for leadership : verification of root contention in IEEE 1394 , 1999 .
[22] Hans Toetenel,et al. Partition Refinement in Real-Time Model Checking , 1998, FTRTFT.
[23] Kenneth L. McMillan,et al. Symbolic model checking: an approach to the state explosion problem , 1992 .
[24] Mariëlle Stoelinga,et al. Mechanical verification of the IEEE 1394a root contention protocol using Uppaal2k , 2001, International Journal on Software Tools for Technology Transfer.
[25] Marta Z. Kwiatkowska,et al. Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol , 2003, Formal Aspects of Computing.
[26] R. Segala,et al. Automatic Verification of Real-Time Systems with Discrete Probability Distributions , 1999, ARTS.
[27] Conrado Daws,et al. Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM , 2002, Electron. Notes Theor. Comput. Sci..
[28] Annabelle McIver. Quantitative Program Logic and Performance in Probabilistic Distributed Algorithms , 1999, ARTS.
[29] F. Vaandrager,et al. Linear Parametric Model Checking of Timed Automata , 2001 .
[30] Nancy A. Lynch,et al. Proving time bounds for randomized distributed algorithms , 1994, PODC '94.