Symbolic Verification of Communication Protocols with Infinite State Spaces Using QDDs (Extended Abstract)
No abstract available.
DOI 10.1007/3-540-61474-5_53
Related papers
- Characterizing Implementability of Global Protocols with Infinite States and Data OOPSLA 2025
- The Power of QDDs (Extended Abstract) SAS 1997
- Model Checking for Programming Languages using Verisoft POPL 1997
- Adding Liveness Properties to Coupled Finite-State Machines TOPLAS 1990
- Measurement-Based Verification of Quantum Markov Chains CAV 2024
- Branching Bisimulation Learning CAV 2025
- Parikh's Theorem Made Symbolic POPL 2024
- The MoXI Model Exchange Tool Suite CAV 2024