Easy Parameterized Verification of Biphase Mark and 8N1 Protocols

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].

[1]  Dang Van Hung,et al.  Modelling and verification of Biphase Mark Protocols in Duration Calculus using PVS , 1998, Proceedings 1998 International Conference on Application of Concurrency to System Design.

[2]  Frits W. Vaandrager,et al.  Analysis of a biphase mark protocol with Uppaal and PVS , 2006, Formal Aspects of Computing.

[3]  John M. Rushby.  Verification Diagrams Revisited: Disjunctive Invariants for Easy Verification , 2000, CAV.

[4]  Stanimir Ivanov,et al.  Verification of a Biphase Mark Protocol , 1999 .

[5]  H. Wong-Toi,et al.  Some lessons from the HYTECH experience , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[6]  J. Strother Moore,et al.  A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol , 2005, Formal Aspects of Computing.

[7]  Geoffrey M. Brown.  Verification of a Data Synchronization Circuit For All Time , 2006, Sixth International Conference on Application of Concurrency to System Design (ACSD'06).

[8]  Ahmed Bouajjani,et al.  TReX: A Tool for Reachability Analysis of Complex Systems , 2001, CAV.

[9]  Steven D. Johnson,et al.  The formal verification of a reintegration protocol , 2005, EMSOFT.

[10]  Bruno Dutertre,et al.  Timed Systems in SAL , 2004 .

[11]  Harald Ruess,et al.  Bounded Model Checking and Induction: From Refutation to Verification (Extended Abstract, Category A) , 2003, CAV.

[12]  Natarajan Shankar,et al.  The ICS Decision Procedures for Embedded Deduction , 2004, IJCAR.

[13]  Bruno Dutertre,et al.  Modeling and Verification of a Fault-Tolerant Real-Time Startup Protocol Using Calendar Automata , 2004, FORMATS/FTRTFT.

[14]  Harald Ruess,et al.  Bounded Model Checking and Induction: From Refutation to Verification (Extended Abstract, Category A) , 2003, CAV.