Prioritized traversal: Efficient reachability analysis for verification and falsification

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

Volumn 1855, Issue , 2000, Pages 389-402

  Fraer, Ranan ^a   Kamhi, Gila ^a   Ziv, Barukh ^a   Vardi, Moshe Y ^b   Fix, Limor ^a  

^a INTEL CORPORATION   (Israel)

^b Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; CRIME; EDGE DETECTION;

CORNER CASE; DEAD-ENDS; PARTITIONING ALGORITHMS; PRIORITY FUNCTIONS; REACHABILITY; REACHABILITY ANALYSIS; TASK-NEEDS;

PROGRAM DEBUGGING;

EID: 84944414446     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722167_30     Document Type: Conference Paper

References (20)

1. K. Ravi, F. Somenzi, “High Density Reachability Analysis”, in Proceedings of ICCAD’95
2. M. Ganai, A Aziz, “Efficient Coverage Directed State Space Search”, in Proceedings of IWLS’98
3. J. Yuan, J. Shen, J. Abraham, and A. Aziz, “On Combining Formal and Informal Verification”, in Proceedings of CAV’97
4. C. Yang, D. Dill, “Validation with Guided Search of the State Space”, In Proceedings of DAC’98
5. A. Aziz, J. Kukula, T. Shiple, “Hybrid Verification Using Saturated Simulation”, In Proceedings of DAC’98
6. R. Bryant, “Graph-based Algorithms for Boolean Function Manipulations”, IEEE Transactions on Computers,C-35:677-691, August 1986.
7. K. L. McMillan. “Symbolic Model Checking”, Kluwer 1993.
8. T. R. Shiple “Formal Analysis of Synchronous Circuits”. PhD thesis, University of California at Berkeley, 1996.
9. K. Ravi, K. L. McMillan, T. R. Shiple, F. Somenzi “Approximation and Decomposition of Binary Decision Diagrams”, in Proceedings of DAC’98.
10. O. Coudert, J. Madre “A Unified Framework for the Formal Verification of Sequential Circuits”, in Proceedings of ICCAD’90.
11. K. Ravi, F. Somenzi, “Efficient Fixpoint Computation for Invariant Checking”, In Proceedings of ICCD’99, pp. 467-474.
12. B. Lin, R. Newton “Implicit Manipulation of Equivalence Classes Using Binary Decision Diagrams” in Proceedings of ICCD’91.
13. G. Cabodi, P. Camurati, S. Quer. “Improved Reachability Analysis of Large Finite State Machines” in Proceedings of ICCAD’96.
14. A. Narayan, J. Jain, M. Fujita, A. Sangiovanni-Vincentelli. “Partitioned ROBDDs – A Compact, Canonical and Efficiently Manipulable Representation for Boolean Functions” in Proceedings of ICCAD’96.
15. R. Fraer, G. Kamhi, L. Fix, M. Vardi. “Evaluating Semi-Exhaustive Verification Techniques for Bug Hunting” in Proceedings of SMC’99
16. I. Beer, S. Ben-David, A. Landver. “On-the-Fly Model Checking” of RCTL Formulas”, in Proceedings of CAV’98
17. G. Cabodi, P. Camurati, S. Quer, "Improving the Efficiency of BDD-Based Operators by Means of Partitioning," IEEE Transactions on CAD, pp. 545-556, May 1999.
18. F. Somenzi, “CUDD: CU Decision Diagram Package – Release 2. 3. 0”, Technical Report, Dept. Electrical and Computer Engineering, University of Colorado, Boulder
19. R. H. Hardin, R. P. Kurshan, K. L. McMillan, J. A. Reeds and N. J. A. Sloane, “Efficient Regression Verification”, Int'l Workshop on Discrete Event Systems (WODES '96), 19-21 August, Edinburgh, IEE, London, 1996, pp. 147-150.
20. J. R. Burch, E. M. Clarke, D. E. Long, K. L. McMillan, D. L. Dill, “Symbolic Model Checking for Sequential Circuit Verification”, IEEE Transactions on Computer-Aided Designs of Integrated Circuits and Systems, 401-424 Vol. 13, No. 4, April 1994.