Exploiting transition locality in automatic verification

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

Volumn 2144, Issue , 2001, Pages 259-274

  Tronci, Enrico ^a   Penna, Giuseppe Della ^a   Intrigila, Benedetto ^a   Zilli, Marisa Venturini ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; SPACE RESEARCH;

AUTOMATIC VERIFICATION; BREADTH-FIRST; EXPLICIT STATE SPACE EXPLORATIONS; HASH COMPACTION; OPTIMIZATION TECHNIQUES; STATE EXPLOSION; STATE REDUCTION; VERIFICATION ALGORITHMS;

RANDOM ACCESS STORAGE;

EID: 33749014236     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44798-9_22     Document Type: Conference Paper

References (22)

1. R. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. on Computers, C-35(8), Aug 1986.
2. J.R. Burc h, E.M. Clark e, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, (98), 1992.
3. 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.
4. G.J. Holzmann. The spin model checker. IEEE Trans. on Software Engineering, 23(5):279–295, May 1997.
5. G.J. Holzmann. An analysis of bitstate hashing. Formal Methods in Systems Design, 1998.
6. A.J. Hu, G. York, and D.L. Dill. New techniques for efficient verification with implicitily conjoined bdds. In 31st IEEE Design Automation Conference, pages 276–282, 1994.
7. C.N. Ip and D.L. Dill. Better verification through symmetry. In 11th International Conference on Computer Hardware Description Languages and their Applications, pages 97–111, 1993.
8. 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.
9. Heh-Tyan Liaw and Chen-Shang Lin.On the obdd-representation of general boolean functions. IEEE Trans. on Computers, C-41(6), June 1992.
10. url: http://sprout.stanford.edu/dill/murphi.html.
11. A. Papoulis. Probability, Random Variables and Stochastic Processes. McGra w- Hill Series in System Sciences, 1965.
12. D.A. Patterson and J.L. Hennessy. Computer Architecture A Quantitative Approach. Morgan Kaufmann, 1996.
13. R.K. Ranjan, J.V. Sanghavi, R.K. Brayton, and A. Sangiovanni-Vincentelli. Binary decision diagrams on network of workstations. In IEEE International Conference on Computer Design, pages 358–364, 1996.
14. J.V. Sanghavi, R.K. Ranjan, R.K. Brayton, and A. Sangiovanni-Vincentelli. High performance bdd package by exploiting memory hierarchy. In 33rd IEEE Design Automation Conference, 1996.
15. url: http://netlib.bell-labs.com/netlib/spin/whatispin.html.
16. U. Stern and D. Dill. Parallelizing the mur(formula presented) verifier. In Proc. 9th Int. Conference on Computer Aided Verification, volume 1254, pages 256–267, Haifa, Israel, 1997. LNCS, Springer.
17. U. Stern and D. Dill. Using magnetic disk instead of main memory in the murϕ verifier. In Proc. 10th Int. Conference on Computer Aided Verification, volume 1427, pages 172–183, Vancouver, BC, Canada, 1998.LNCS, Springer.
18. U. Stern and D.L. Dill. Improved probabilistic verification by hash compaction. In IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods, pages 206–224, 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, 1996.
20. url: http://verify.stanford.edu/uli/research.html.
21. T. Stornetta and F. Brewer. Implementation of an efficient parallel bdd package. In 33rd IEEE Design Automation Conference, pages 641–644, 1996.
22. Pierre Wolper and Dennis Leroy. Reliable hashing without collision detection. In Proc. 5th Int. Conference on Computer Aided Verification, pages 59–70, Elounda, Greece, 1993.