Abstract
The Biphase Mark Protocol (BMP) and 8N1 Protocol are physical layer protocols for data transmission. We present a generic model in which timing and error values are parameterized by linear constraints, and then we use this model to verify these protocols. The verifications are carried out using SRI’s SAL model checker that combines a satisfiability modulo theories decision procedure with a bounded model checker for highly-automated induction proofs of safety properties over infinite-state systems. Previously, parameterized formal verification of real-time systems required mechanical theorem-proving or specialized real-time model checkers; we describe a compelling case-study demonstrating a simpler and more general approach. The verification reveals a significant error in the parameter ranges for 8N1 given in a published application note [1].
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Maxim Integrated Products, Inc. Determining Clock Accuracy Requirements for UART Communications (June 2003), available at http://www.maxim-ic.com/appnotes.cfm/appnotenumber/2141
Moore, J.S.: A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol. Formal Aspects of Computing 6(1), 60–91 (1994)
Hung, D.V.: Modelling and verification of biphase mark protocols using PVS. In: Proceedings of the International Conference on Applications of Concurrency to System Design (CSD 1998), pp. 88–98. IEEE Computer Society Press, Los Alamitos (1998)
Ivanov, S., Griffioen, W.O.D.: Verification of a biphase mark protocol. Technical Report CSI-R9915, University of Nijmegen Computing Science Institute (1999)
Henzinger, T., Preussig, J., Wong-Toi, H.: Some lessons from the Hytech experience. In: Proceedings of the 40th Annual Conference on Decision and Control, pp. 2887–2892 (2001)
Vaandrager, F.W., de Groot, A.L.: Analysis of a Biphase Mark Protocol with Uppaal and PVS. Technical Report NIII-R0455, Nijmegen Institute for Computing and Information Science (2004)
de Moura, L., Owre, S., Rueß, H., Rushby, J., Shankar, N., Sorea, M., Tiwari, A.: SAL 2. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 496–500. Springer, Heidelberg (2004)
de Moura, L., Rueß, H., Sorea, M.: Bounded model checking and induction: From refutation to verification. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 14–26. Springer, Heidelberg (2003)
de Moura, L., Owre, S., Rueß, H., Rushby, J., Shankar, N.: The ICS decision procedures for embedded deduction. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, pp. 218–222. Springer, Heidelberg (2004)
Dutertre, B., Sorea, M.: Timed systems in SAL. Technical Report SRISDL-04-03, SRI International (2004)
Dutertre, B., Sorea, M.: Modeling and verification of a fault-tolerant realtime startup protocol using calendar automata. In: FORMATS/FTRTFT, pp. 199–214 (2004)
Rushby, J.: Verification diagrams revisited: Disjunctive invariants for easy verification. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855. Springer, Heidelberg (2000)
Annichini, A., Bouajjani, A., Sighireanu, M.: TREX: A tool for reachability analysis of complex systems. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 368–372. Springer, Heidelberg (2001)
Pike, L., Johnson, S.D.: The formal verification of a reintegration protocol. In: EMSOFT 2005: Proceedings of the 5th ACM international conference on Embedded software, pp. 286–289. ACM Press, New York (2005)
Brown, G.M.: Verification of a data synchronization circuit for all time (Unpublished) (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brown, G.M., Pike, L. (2006). Easy Parameterized Verification of Biphase Mark and 8N1 Protocols. In: Hermanns, H., Palsberg, J. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2006. Lecture Notes in Computer Science, vol 3920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11691372_4
Download citation
DOI: https://doi.org/10.1007/11691372_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33056-1
Online ISBN: 978-3-540-33057-8
eBook Packages: Computer ScienceComputer Science (R0)