Computer networks
Trace theory for automatic hierarchical verification of speed-independent circuits
Trace theory for automatic hierarchical verification of speed-independent circuits
Proceedings of the Fourth Annual Symposium on Logic in computer science
Analysis of discrete event coordination
REX workshop Proceedings on Stepwise refinement of distributed systems: models, formalisms, correctness
Design and validation of computer protocols
Design and validation of computer protocols
Stubborn sets for reduced state generation
APN 90 Proceedings on Advances in Petri nets 1990
Handbook of theoretical computer science (vol. B)
Shared binary decision diagram with attributed edges for efficient Boolean function manipulation
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Model checking and abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A partial approach to model checking
Papers presented at the IEEE symposium on Logic in computer science
Model checking, abstraction, and compositional verification
Model checking, abstraction, and compositional verification
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Symbolic Model Checking
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Principles of Concurrent Programming
Principles of Concurrent Programming
Mona: Monadic Second-Order Logic in Practice
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Compositional Minimization of Finite State Systems
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Exploiting Symmetry In Temporal Logic Model Checking
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
A Tool for Symbolic Program Verification and Abstration
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Combining Partial Order Reductions with On-the-fly Model-Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata-theoretic Approach
Proceedings of the 7th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Better Verification Through Symmetry
CHDL '93 Proceedings of the 11th IFIP WG10.2 International Conference sponsored by IFIP WG10.2 and in cooperation with IEEE COMPSOC on Computer Hardware Description Languages and their Applications
Symbolic Protocol Verification with Queue BDDs
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Model Checking LTL Properties of High-Level Petri Nets with Fairness Constraints
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
| Hi-index | 0.00 |
Symbolic verification based on Binary Decision Diagrams(BDDs) has proven to be a powerful technique for ensuring thecorrectness of digital hardware. In contrast, BDDs have not caught onas widely for software verification, partly because the data typesused in software are more complicated than those used in hardware. Inthis work, we propose an extension of BDDs for dealing with dynamicdata structures. Specifically, we focus on queues, since they arecommonly used in modeling communication protocols. We introduce QueueBDDs (QBDDs), which include all the power of BDDs while also providingan efficient representation of queue contents. Experimental resultsshow that QBDDs are well-suited for the verification of communicationprotocols.