Verification Diagrams Revisited: Disjunctive Invariants for Easy Verification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
TReX: A Tool for Reachability Analysis of Complex Systems
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Modeling and Verification of Biphase Mark Protocolsin Duration Calculus Using PVS
CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design
The formal verification of a reintegration protocol
Proceedings of the 5th ACM international conference on Embedded software
Model checking for the practical verificationist: a user's perspective on SAL
Proceedings of the second workshop on Automated formal methods
Extending Lustre with Timeout Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
An SMT Approach to Bounded Reachability Analysis of Model Programs
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Roll your own test bed for embedded real-time protocols: a haskell experience
Proceedings of the 2nd ACM SIGPLAN symposium on Haskell
Machine-Assisted Parameter Synthesis of the Biphase Mark Protocol Using Event Order Abstraction
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Analysis of a Clock Synchronization Protocol for Wireless Sensor Networks
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Realistic worst-case execution time analysis in the context of pervasive system verification
Program analysis and compilation, theory and practice
Model checking the FlexRay physical layer protocol
FMICS'10 Proceedings of the 15th international conference on Formal methods for industrial critical systems
SMT-based formal verification of a TTEthernet synchronization function
FMICS'10 Proceedings of the 15th international conference on Formal methods for industrial critical systems
Analysis of a clock synchronization protocol for wireless sensor networks
Theoretical Computer Science
Spatio-temporal model checking for mobile real-time systems
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Automated analysis of parametric timing-based mutual exclusion algorithms
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
A small model theorem for rectangular hybrid automata networks
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
| Hi-index | 0.00 |
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].