Modeling and Verification of Component Connectors
Connectors have shown their great potential for coordination of different components in the large-scale distributed systems. Formal modeling and verification of connectors becomes more critical due to the rapid growth of the size of connectors. In this paper, we present a novel modeling and verification approach of Reo connectors in Coq, including the timed and probabilistic extensions of Reo. When failing to prove whether a property is satisfiable or not with Coq, Z3 solver can be used to generate counterexamples automatically. To promote automated theorem proving in Coq, we proposed an approach based on recurrent neural networks (RNNs) to predict tactics in the proving process.
KeywordsConnector Verification Coq
The work was partially supported by the National Natural Science Foundation of China under grant no. 61772038, 61532019, 61202069 and 61272160.
- 2.Arbab, F., Baier, C., de Boer, F., Rutten, J.: Models and temporal logics for timed component connectors. In: Cuellar, J.R., Liu, Z. (eds.) Proceedings of SEFM 2004, pp. 198–207. IEEE Computer Society (2004)Google Scholar
- 7.Huet, G., Kahn, G., Paulin-Mohring, C.: The Coq proof assistant a tutorial. Rapport Technique, vol. 178 (1997)Google Scholar
- 9.Kaliszyk, C., Mamane, L., Urban, J.: Machine learning of coq proof guidance: first experiments. In: Proceedings of SCSS 2014. EPiC Series in Computing, vol. 30, pp. 27–34. EasyChair (2014)Google Scholar
- 12.Loos, S.M., Irving, G., Szegedy, C., Kaliszyk, C.: Deep network guided proof search. In: Proceedings of LPAR 2017. EPiC Series in Computing, vol. 46, pp. 85–105. EasyChair (2017)Google Scholar
- 16.Zhang, X., Sun, M.: Towards formal modeling and verification of probabilistic connectors in Coq. In: Proceedings of SEKE 2018, pp. 385–390. KSI Research Inc. and Knowledge Systems Institute Graduate School (2018)Google Scholar