Symbolic protocol verification with queue BDDs
- 24 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 939, 198-206
- https://doi.org/10.1109/lics.1996.561318
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Compositional model checkingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A partial approach to model checkingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Symbolic verification of communication protocols with infinite state spaces using QDDsPublished by Springer Nature ,1996
- Partial-Order Methods for the Verification of Concurrent SystemsPublished by Springer Nature ,1996
- Utilizing symmetry when model checking under fairness assumptions: An automata-theoretic approachPublished by Springer Nature ,1995
- A tool for symbolic program verification and abstractionPublished by Springer Nature ,1993
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- Model checking and abstractionPublished by Association for Computing Machinery (ACM) ,1992
- Stubborn sets for reduced state space generationPublished by Springer Nature ,1991
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977