Abstract
An important task of testing a telecommunication protocol consists in analysing logs. The goal of log analysis is to check that the timing and the content of transmitted messages comply with specification. In order to perform such checks, protocols can be described using a constraint modelling language. In this paper we focus on a complex protocol where some messages can be delayed. Simply introducing variables for possible delays for all messages in the constraint model can drastically increase the complexity of the problem. However, some delays can be calculated, but this calculation is difficult to do by hand and to justify. We present an industrial application of the Coq proof assistant to prove a property of a 4G protocol and validate a constraint model. By using interactive theorem proving we derived constraints for message delays of the protocol and found missing constraints in the initial model.
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
Notes
- 1.
The Coq model is available at https://github.com/astra-uu-se/SEFM18.
References
3GPP. Public warning system (PWS) requirements. TS 22.268, 3rd Generation Partnership Project (3GPP). http://www.3gpp.org/ftp/Specs/html-info/22268.htm
Barras, B., Werner, B.: Coq in Coq. Technical report, INRIA-Rocquencourt (1997)
Bengtson, J., Parrow, J., Weber, T.: Psi-Calculi in Isabelle. J. Autom. Reasoning 56(1), 1–47 (2016)
Bessiere, C., Hebrard, E., Katsirelos, G., Kiziltan, Z., Narodytska, N., Walsh, T.: Reasoning about Constraint Models. In: Pham, D.-N., Park, S.-B. (eds.) PRICAI 2014. LNCS (LNAI), vol. 8862, pp. 795–808. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-13560-1_63
Bezem, M., Bol, R., Groote, J.F.: Formalizing process algebraic verifications in the calculus of constructions. Formal Aspects Comput. 9(1), 1–48 (1997)
Bobot, F., Filliâtre, J.-C., Marché, C., Paskevich, A.: Why3: Shepherd your herd of provers. In: Workshop on Intermediate Verification Languages (2011)
Borgström, J., Huang, S., Johansson, M., Raabjerg, P., Victor, B., Pohjola, J.Å., Parrow, J.: Broadcast psi-calculi with an application to wireless protocols. Softw. Syst. Model. 14(1), 201–216 (2015)
Cadoli, M., Mancini, T.: Using a theorem prover for reasoning on constraint problems. Appl. Artif. Intell. 21(4&5), 383–404 (2007)
Giménez, E.: An application of co-inductive types in Coq: verification of the alternating bit protocol. In: Berardi, S., Coppo, M. (eds.) TYPES 1995. LNCS, vol. 1158, pp. 135–152. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-61780-9_67
Gonthier, G.: The four colour theorem: engineering of a formal proof. In: 8th Asian Symposium of Computer Mathematics, p. 333. ASCM (2007)
Grinchtein, O., Carlsson, M., Pearson, J.: A constraint optimisation model for analysis of telecommunication protocol logs. In: Blanchette, J.C., Kosmatov, N. (eds.) TAP 2015. LNCS, vol. 9154, pp. 137–154. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21215-9_9
Groote, J.F., Ponse, A.: The syntax and semantics of \(\mu \)CRL. In: Ponse, A., Verhoef, C., van Vlijmen, S.F.M. (eds.) Algebra of Communicating Processes. Workshops in Computing. Springer, London (1995). https://doi.org/10.1007/978-1-4471-2120-6_2
Hasan, O., Tahar, S.: Performance analysis and functional verification of the stop-and-wait protocol in HOL. J. Autom. Reason. 42(1), 1–33 (2009)
Leroy, X.: Formal verification of a realistic compiler. Commun. ACM 52(7), 107–115 (2009)
Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529–543. Springer, Heidelberg (2007)
Nipkow, T., Paulson, L.C., Wenzel, M. (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
Qadir, J., Hasan, O.: Applying formal methods to networking: theory, techniques, and applications. IEEE Commun. Surv. Tutorials 17(1), 256–291 (2015)
Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier, New York (2006)
Sunshine, C.A.: Survey of protocol definition and verification techniques. SIGCOMM Comput. Commun. Rev. 8(3), 35–41 (1978)
The Coq Development Team. The Coq proof assistant reference manual version 8.6 (2016)
Acknowledgments
The second author was supported by Swedish Foundation for Strategic Research. The third author is partially support by the Swedish Research Council VR.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Dubois, C., Grinchtein, O., Pearson, J., Carlsson, M. (2018). Exploring Properties of a Telecommunication Protocol with Message Delay Using Interactive Theorem Prover. In: Johnsen, E., Schaefer, I. (eds) Software Engineering and Formal Methods. SEFM 2018. Lecture Notes in Computer Science(), vol 10886. Springer, Cham. https://doi.org/10.1007/978-3-319-92970-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-92970-5_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-92969-9
Online ISBN: 978-3-319-92970-5
eBook Packages: Computer ScienceComputer Science (R0)