Bloom filters in probabilistic verification

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

Volumn 3312, Issue , 2004, Pages 367-381

  Dillinger, Peter C ^a   Manolios, Panagiotis ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDPASS FILTERS; COMPACTION; COMPUTER AIDED DESIGN; FORMAL METHODS; HASH FUNCTIONS; MODEL CHECKING;

COMPUTATIONAL COSTS; DETERMINISTIC TECHNIQUE; EXTENSIVE TESTING; FINITE-STATE TRANSITION SYSTEMS; MATHEMATICAL ANALYSIS; MEMORY EFFICIENT; PROBABILISTIC TECHNIQUE; PROBABILISTIC VERIFICATION;

DATA STRUCTURES;

EID: 26944503580     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30494-4_26     Document Type: Article

References (23)

1. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, July 1970.
2. A. Broder and M. Mitzenmacher. Network applications of Bloom filters: A survey. In Proc. of the 40th Annual Allerton Conference on Communication, Control, and Computing, pages 636-646, 2002.
3. C.N. Ip and D.L. Dill. Better verification through symmetry. In Computer Hardware Description Languages and their Applications, pages 87-100, Ottawa, Canada, 1993. Elsevier Science Publishers B.V., Amsterdam, Netherland.
4. T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson. Introduction to Algorithms. McGraw-Hill Higher Education, 2001.
5. P. C. Dillinger and P. Manolios. Fast and accurate bitstate verification for SPIN. In 11th SPIN Workshop, Barcelona, Spain, April 2004.
6. E.M. Clarke, T. Filkorn, and S. Jha. Exploiting symmetry in temporal logic model checking. In CAV'93, pages 450-461, June 1993.
7. F. A. Emerson and A. P. Sistla. Symmetry and model checking. Formal Methods in System Design: An International Jouenal,9(1/2):105-131, August 1996.
8. L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary cache: a scalable wide-area Web cache sharing protocol. IEEE/ACM Transactions on Networking, 8(3):281-293, 2000.
9. P. Godefroid and P. Wolper. A partial approach to model checking. In Logic in Computer Science, pages 406-415, 1991.
10. G. H. Gonnet. Handbook of Algorithms and Data Structures. Addison-Wesley, 1984.
11. G. Holzmann and D. Peled. Partial order reduction of the state space. In First SPIN Workshop, Montrèal, Quebec, 1995.
12. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
13. G. J. Holzmann. An analysis of bitstate hashing. In Proc. 15th Int. Confon Protocol Specification, Testing, and Verification, INWG/IFIP, pages 301-314, Warsaw, Poland, 1995. Chapman & Hall.
14. G. J. Holzmann. The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, Boston, Massachusetts, 2003.
15. D. E. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. Addison Wesley Longman Publishing Co., Inc., 2nd edition, 1997.
16. M. Mitzenmacher. Compressed Bloom filters. In Proc. of the 20th Annual ACM Symposium on Principles of Distributed Computing, IEEE/ACM Trans, on Net., pages 144-150, 2001.
17. G. Penna, B. Intrigola, E. Tronci, and M. Zilli. Exploiting transition locality in the disk based Murphi verifier. In 4th International Conference on Formal Methods in Computer Aided Verification, pages 202-219, 2002.
18. U. Stern and D. L. Dill. Improved probabilistic verification by hash compaction. In P. Camurati and H. Eveking, editors, Correct Hardware Design and Verification Methods, IFIP WG 10.5 Advanced Research Working Conference, CHARME'95, volume 987 of LNCS, pages 206-224. Springer-Verlag, 1995.
19. U. Stern and D. L. Dill. A new scheme for memory-efficient probabilistic verification. In IFIP TC6/WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols, and Protocol Specification, Testing, and Verification, pages 333-348, 1996. Kaiserslautem Germany, October 8-11.
20. W. Visser, K. Havelund, G. Brat, and S. Park. Model checking programs. In International Conference on Automated Sofnvare Engineering, Sept. 2000.
21. P. Wolper and D. Leroy. Reliable hashing without collision detection. In 5th International Conference on Computer Aided Verification, pages 59-70, 1993.
22. P. Wolper, U. Stem, D. Leroy, and D. Dill. Reliable probabilistic verification using hash compaction, Unpublished.
23. Y. Yu, P. Manolios, and L. Lamport. Model checking TLA+ specifications. In L. Pierre and T. Kropf, editors, Correct Hardware Design and Verification Methods, CHARME'99, volume 1703 of LNCS, pages 54-66. Springer-Verlag, 1999.