Abstract
Formal modeling and verification of connectors in component-based software systems are getting more interest with recent advancements and evolution in modern software systems. In this paper, we use the proof assistant Coq for modeling and verification of timed connectors. We first present the definition of timed channels and the composition operators for constructing timed connectors in Coq. Basic timed channels are interpreted as axioms and inference rules are used for the specification of composition operators. Furthermore, timed connectors being built by composing basic timed/untimed channels, are defined as logical predicates which describe the relations between inputs and outputs. Within this framework, timed connector properties can be naturally formalized and proved in Coq.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Arbab, F.: Reo: a channel-based coordination model for component composition. Math. Struct. Comput. Sci. 14(3), 329–366 (2004)
Arbab, F., Baier, C., de Boer, F., Rutten, J.: Models and temporal logics for timed component connectors. In: Proceedings of SEFM 2004, pp. 198–207. IEEE Computer Society (2004)
Arbab, F., Rutten, J.: A coinductive calculus of component connectors. Technical report, SEN-R0216, CWI, Amsterdam (2002)
Baier, C., Blechmann, T., Klein, J., Klüppelholz, S., Leister, W.: Design and verification of systems with exogenous coordination using vereofy. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol. 6416, pp. 97–111. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-16561-0_15
Baier, C., Sirjani, M., Arbab, F., Rutten, J.: Modeling component connectors in Reo by constraint automata. Sci. Comput. Program. 61, 75–113 (2006)
Bertot, Y., Casteran, P.: Interactive Theorem Proving and Program Development. Coq‘Art: The Calculus of Inductive Construction. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-662-07964-5
Clarke, D., Costa, D., Arbab, F.: Modelling coordination in biological systems. In: Margaria, T., Steffen, B. (eds.) ISoLA 2004. LNCS, vol. 4313, pp. 9–25. Springer, Heidelberg (2006). https://doi.org/10.1007/11925040_2
Clarke, D., Costa, D., Arbab, F.: Connector coloring I: synchronization and context dependency. Sci. Comput. Program. 66(3), 205–225 (2007)
Coq Implementation of Connectors. https://github.com/WJ-Hong/Timed-Reo
Diakov, N., Arbab, F.: Compositional construction of web services using Reo. In: Proceedings of International Workshop on Web Services: Modeling, Architecture and Infrastructure (ICEIS 2004), pp. 13–14. INSTIC Press (2004)
Gelernter, D., Carriero, N.: Coordination languages and their significance. Coomun. ACM 35(2), 96 (1992)
Huet, G., Kahn, G., Paulin-Mohring, C.: The Coq proof assistant a tutorial. Rapport Technique, 178 (1997)
Jongmans, S.T.Q., Arbab, F.: Overview of thirty semantic formalisms for Reo. Sci. Ann. Comp. Sci. 22(1), 201–251 (2012)
Khosravi, R., Sirjani, M., Asoudeh, N., Sahebi, S., Iravanchi, H.: Modeling and analysis of Reo connectors using alloy. In: Lea, D., Zavattaro, G. (eds.) COORDINATION 2008. LNCS, vol. 5052, pp. 169–183. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68265-3_11
Kokash, N., Krause, C., de Vink, E.: Reo+mCRL2: a framework for model-checking dataflow in service compositions. Formal Aspects Comput. 24, 187–216 (2012)
Li, Y., Sun, M.: Modeling and verification of component connectors in Coq. Sci. Comput. Program. 113(3), 285–301 (2015)
Nipkow, T., Wenzel, M., Paulson, L.C. (eds.): Isabelle/HOL: A Proof Assistant for Higher-Order Logic. LNCS, vol. 2283. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45949-9
Owre, S., Rushby, J.M., Shankar, N.: PVS: a prototype verification system. In: Kapur, D. (ed.) CADE 1992. LNCS, vol. 607, pp. 748–752. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-55602-8_217
Sun, M.: Connectors as designs: the time dimension. In: Proceedings of TASE 2012, pp. 201–208. IEEE Computer Society (2012)
Sun, M., Arbab, F.: Web services choreography and orchestration in Reo and constraint automata. In: Proceedings of SAC 2007, pp. 346–353. ACM (2007)
Sun, M., Arbab, F., Aichernig, B.K., Astefanoaei, L., de Boer, F.S., Rutten, J.: Connectors as designs: modeling, refinement and test case generation. Sci. Comput. Program. 77(7–8), 799–822 (2012)
Zhang, X., Hong, W., Li, Y., Sun, M.: Reasoning about connectors in Coq. In: Kouchnarenko, O., Khosravi, R. (eds.) FACS 2016. LNCS, vol. 10231, pp. 172–190. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-57666-4_11
Zlatev, Z., Diakov, N., Porkaev, S.: Construction of negotiation protocols for e-commerce applications. ACM SIGecom Exch. 5(2), 12–22 (2004)
Acknowledgement
The work was partially supported by the National Natural Science Foundation of China under grant no. 61772038, 61532019, 61202069 and 61272160.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Hong, W., Nawaz, M.S., Zhang, X., Li, Y., Sun, M. (2018). Using Coq for Formal Modeling and Verification of Timed Connectors. In: Cerone, A., Roveri, M. (eds) Software Engineering and Formal Methods. SEFM 2017. Lecture Notes in Computer Science(), vol 10729. Springer, Cham. https://doi.org/10.1007/978-3-319-74781-1_37
Download citation
DOI: https://doi.org/10.1007/978-3-319-74781-1_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-74780-4
Online ISBN: 978-3-319-74781-1
eBook Packages: Computer ScienceComputer Science (R0)