Improved probabilistic verification by hash compaction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 987, Issue , 1995, Pages 206-224

  Stern, Ulrich ^a   Dill, David L ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

COMPRESSED STATE; EXPLICIT STATE; FALSE POSITIVE; HASH COMPACTION; NON-ZERO PROBABILITY; PRACTICAL ISSUES; PROBABILISTIC METHODS; PROBABILISTIC VERIFICATION;

PROBABILITY;

EID: 35048872486     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60385-9_13     Document Type: Conference Paper

References (17)

1. O. Amble and D. E. Knuth. Ordered hash tables. Computer Journal, 17(2):135-42, 1974.
2. J. R. Burch, E. M. Clarke, K. L. McMillan, and D. L. Dill. Sequential circuit verification using symbolic model checking. In 27th ACM/IEEE Design Automation Conference, pages 46-51, 1990.
3. J. L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18(2):143-154, 1979.
4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, 1990.
5. D. L. Dill, A. J. Drexler, A. J. Hu, and C. H. Yang. Protocol verification as a hardware design aid. In IEEE International Conference on Computer Design: VLSI in Computers and Processors, pages 522-5, 1992.
6. D. L. Dill, S. Park, and A. G. Nowatzyk. Formal specification of abstract memory models. In Symposium on Research on Integrated Systems, pages 38-52, 1993.
7. G. H. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Structures. Addison-Wesley Publishing Company, 2nd edition, 1991.
8. R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley Publishing Company, 1988.
9. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall, 1991.
10. A. J. Hu, G. York, and D. L. Dill. New techniques for efficient verification with implicitly conjoined BDDs. In 31st Design Automation Conference, pages 276-82, 1994.
11. IEEE Std 1596-1992, IEEE Standard for Scalable Coherent Interface (SCI).
12. C. N. Ip and D. L. Dill. Efficient verification of symmetric concurrent systems. In IEEE International Conference on Computer Design: VLSI in Computers and Processors, pages 230-234, 1993.
13. D. E. Knuth. The Art of Computer Programming, volume 3. Addison-Wesley Publishing Company, 1973.
14. U. Stern and D. L. Dill. Automatic verification of the SCI cache coherence protocol. In IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods, 1995.
15. P. Wolper and D. Leroy. Reliable hashing without collision detection. Unpublished revised version of [16].
16. P. Wolper and D. Leroy. Reliable hashing without collision detection. In Computer Aided Verification. 5th International Conference, pages 59-70, 1993.
17. TM-I. In 32nd Design Automation Conference, pages 7-12, 1995.