Using Compositional Preorders in the Verification of Sliding Window Protocal
No abstract available.
Related papers
- Verification and Improvement of the Sliding Window Protocol TACAS 2003
- Sliding Window Abstraction for Infinite Markov Chains CAV 2009
- A Stepwise Refinement Heuristic for Protocol Construction TOPLAS 1992
- Towards a Mechanization of Cryptographic Protocal Verification CAV 1997
- Model Checking and Modular Verification TOPLAS 1994
- Calculating a linear-time solution to the densest-segment problem JFP 2015
- Proving Memory Safety of the ANI Windows Image Parser Using Compositional Exhaustive Testing VMCAI 2015
- Time Robustness in MTL and Expressivity in Hybrid System Falsification CAV 2015