Modeling and verifying the topology discovery mechanism of OpenFlow controllers in software-defined networks using process algebra
暂无分享,去创建一个
Marcello M. Bonsangue | Lei Zhang | Huibiao Zhu | Xi Wu | Shuangqing Xiang | Wanling Xie | Lili Xiao | M. Bonsangue | Wanling Xie | Xi Wu | Lei Zhang | Lili Xiao | Huibiao Zhu | Shuangqing Xiang
[1] Nick McKeown,et al. OpenFlow: enabling innovation in campus networks , 2008, CCRV.
[2] Shengchao Qin,et al. Comparative modelling and verification of Pthreads and Dthreads , 2018, J. Softw. Evol. Process..
[3] Jun Sun,et al. Model checking with fairness assumptions using PAT , 2014, Frontiers of Computer Science.
[4] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.
[5] A. W. Roscoe. Understanding Concurrent Systems , 2010, Texts in Computer Science.
[6] Mohsen Guizani,et al. Topology Discovery in Software Defined Networks: Threats, Taxonomy, and State-of-the-Art , 2017, IEEE Communications Surveys & Tutorials.
[7] A. W. Roscoe,et al. Using CSP to Detect Errors in the TMN Protocol , 1997, IEEE Trans. Software Eng..
[8] Fernando M. V. Ramos,et al. Software-Defined Networking: A Comprehensive Survey , 2014, Proceedings of the IEEE.
[9] Jadwiga Indulska,et al. Efficient topology discovery in OpenFlow-based Software Defined Networks , 2016, Comput. Commun..
[10] Xi Wu,et al. Formalization and analysis of the REST architecture from the process algebra perspective , 2016, Future Gener. Comput. Syst..
[11] Daniel Jackson,et al. Software Abstractions - Logic, Language, and Analysis , 2006 .
[12] Ling Shi,et al. Modeling and verifying hierarchical real-time systems using stateful timed CSP , 2013, TSEM.