Using magnetic disk instead of main memory in the mur φ Verifier

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

Volumn 1427 LNCS, Issue , 1998, Pages 172-183

  Stern, Ulrich ^a   Dill, David L ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; NONVOLATILE STORAGE; ALGORITHMS; MULTIPROCESSING SYSTEMS;

BREADTH-FIRST; CACHE COHERENCE PROTOCOLS; EXPLICIT STATE; HASH COMPACTION; MAGNETIC DISK; MEMORY SAVINGS; ORDERS OF MAGNITUDE; RUNTIME OVERHEADS;

CACHE MEMORY;

EID: 84863899988     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0028743     Document Type: Conference Paper

References (17)

1. 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. (Pubitemid 21676647)
2. J. L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18(2):143-54, 1979.
3. C.-T. Chou and D. Peled. Formal verification of a partial-order reduction technique for model checking. In Tools and Algorithms for the Construction and Analysis of Systems. 2nd International Workshop, pages 241-57, 1996. (Pubitemid 126050418)
4. D. L. Dill. The Mmiφ verification system. In Computer Aided Verification. 8th International Conference, pages 390-3, 1996.
5. G. J. Holzmann. On limits and possibilities of automated protocol analysis. In Protocol Specification, Testing, and Verification. 1th International Conference, pages 339-44, 1987.
6. G. J. Holzmann and D. Peled. The state of SPIN. In Computer Aided Verification. 8th International Conference, pages 385-9, 1996. (Pubitemid 126101297)
7. IEEE Std 1596-1992, IEEE Standard for Scalable Coherent Interface (SCI)
8. C. N. Ip. State Reduction Methods for Automatic Formal Verification. PhD thesis, Stanford University, 1996.
9. J. Kuskin, D. Ofelt, M. Heinrich, J. Heinlein, R. Simoni, K. Gharachorloo, J. Chapin, D. Nakahira, J. Baxter, M. Horowitz, A. Gupta, M. Rosenblum, and J. Hen-nessy. The Stanford FLASH multiprocessor. In 21st Annual International Symposium on Computer Architecture, pages 302-13, 1994.
10. D. Lenoski, J. Laudon, K. Gharachorloo, W.-D. Weber, A. Gupta, J. Hennessy, M. Horowitz, and M. S. Lam. The Stanford DASH multiprocessor. Computer, 25(3):63-79, 1992.
11. D. Peled. Combining partial order reductions with on-the-fiy model-checking. In Computer Aided Verification. 6th International Conference, pages 377-90, 1994.
12. A. W. Roscoe. Model-checking CSP. In A Classical Mind, Essays in Honour of C. A. R. Hoare. Prentice-Hall, 1994.
13. U. Stern. Algorithmic Techniques in Verification by Explicit State Enumeration. PhD thesis, Technical University of Munich, 1997.
14. U. Stern and D. L. Dill. Improved probabilistic verification by hash compaction. In Advanced Research Working Conference on Correct Hardware Design and Verification Methods, pages 206-24, 1995.
15. U. Stern and D. L. Dill. A new scheme for memory-efficient probabilistic verification. In Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols, and Protocol Specification, Testing, and Verification, pages 333-48, 1996.
16. U. Stern and D. L. Dill. Parallelizing the Murtp verifier. In Computer Aided Verification. 9th International Conference, pages 256-67, 1997.
17. P. Wolper and D. Leroy. Reliable hashing without collision detection. In Computer Aided Verification. 5th International Conference, pages 59-70, 1993.