Dynamic transition relation simplification for bounded property checking

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn , Issue , 2004, Pages 50-57

  Kuehlmann, Andreas ^a  

^a CADENCE DESIGN SYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; CONSTRAINT THEORY; GRAPH THEORY; LOGIC PROGRAMMING; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS);

BOUNDED MODEL CHECKING (BMC); BOUNDED PROPERTY CHECKING; DYNAMIC TRANSITION RELATION SIMPLIFICATION; INDUCTIVE REASONING; LOGIC SYNTHESIS; STRUCTURAL HASHING;

CIRCUIT THEORY;

EID: 16244364010     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu, "Symbolic model checking without BDDs," in 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'99), (Amsterdam, The Netherlands), pp. 193-207, March 1999.
2. K. L. McMillan, Symbolic Model Checking. Boston, MA: Kluwer Academic Publishers, 1993.
3. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an efficient SAT solver," in Proceedings of the 38th ACM/IEEE Design Automation Conference, (Las Vegas, Nevada), pp. 530-535, June 2001.
4. E. Goldberg and Y. Novikov, "BerkMin: A fast and robust SAT-solver," in Design Automation and Test in Europe, (Paris, France), pp. 142-149, March 2002.
5. J. Baumgartner, A. Kuehlmann, and J. Abraham, "Property checking via structural analysis," in Computer-Aided Verification (CAV'02), (Copenhagen, Denmark), pp. 151-165, July 2002.
6. D. Kroening and O. Strichman, "Efficient computation of recurrence diameters," in International Conference on Verification, Model Checking, and Abstract Interpretation, January 2003.
7. P. Chauhan, E. Clarke, J. Kukula, S. Sapra, H. Veith, and D. Wang, "Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis," in Formal Methods in Computer Aided Design (FMCAD'02), pp. 33-51, Springer-Verlag, November 2002.
8. K. L. McMillan and N. Amla, "Automatic abstraction without counterexamples," in International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'03), (Warsaw, Poland), pp. 2-17, April 2003. LNCS 2619.
9. M. Sheeran, S. Singh, and G. Stålmarck, "Checking safety properties using induction and a SAT-solver," in Formal Methods in Computer-Aided Design, (Austin, TX), pp. 108-125, Springer-Verlag, November 2000.
10. A. Gupta, A. Gupta, Z. Yang, and P. Ashar, "Dynamic detection and removal of inactive clauses in SAT with applications in image computation," in 38th Design Automation Conference Proceedings, (Las Vegas, NV), 2001.
11. A. Kuehlmann and F. Krohm, "Equivalence checking using cuts and heaps," in Proceedings of the 34th ACM/IEEE Design Automation Conference, (Anaheim, CA), pp. 263-268, June 1997.
12. A. Kuehlmann, V. Paruthi, F. Krohm, and M. K. Ganai, "Robust Boolean reasoning for equivalence checking and functional property verification," IEEE Transactions on Computer-Aided Design, vol. 21, pp. 1377-1394, December 2002.
13. M. K. Ganai and A. Aziz, "Improved SAT-based bounded reachability analysis," in Proceedings of the 7th ASPDAC/15th International Conference on VLSI Design, pp. 729-734, January 2002.
14. P. Bjesse and K. Claessen, "SAT-based verification without state space traversal," in Formal Methods in Computer-Aided Design (FMCAD '00), (Austin, TX), pp. 372-389, Springer-Verlag, November 2000.
15. O. Shtrichman, "Pruning techniques for the SAT-based bounded model checking problem," in Correct Hardware Design and Verification Methods (CHARME'01), (Livingston, Scotland), pp. 58-70, Springer-Verlag, September 2001.
16. D. Brand, "Verification of large synthesized designs," in Digest of Technical Papers of the IEEE/ACM International Conference on Computer-Aided Design, (Santa Clara, CA), pp. 534-537, November 1993.
17. W. Kunz, "HANNIBAL: An efficient tool for logic verification based on recursive learning," in Digest of Technical Papers of the IEEE/ACM International Conference on Computer-Aided Design, (Santa Clara, CA), pp. 538-543, November 1993.
18. W. Kunz, D. Stoffel, and P. Menon, "Logic optimization and equivalence checking by implication analysis," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 16, pp. 266-281, March 1997.
19. E. Goldberg, M. R. Prasad, and R. K. Brayton, "Using SAT in combinational equivalence checking," in Design Automation and Test in Europe, (Munich, Germany), pp. 114-121, March 2001.
20. F. Lu, L.-C. Wang, K.-T. Cheng, and R. C.-Y. Huang, "A circuit SAT solver with signal correlation guided learning," in Design Automation and Test in Europe, (Munich, Germany), pp. 892-897, March 2003.
21. D. Déharbe and A. M. Moreira, "Using induction and BDDs to model check invariants," in Correct Hardware Design and Verification Methods (CHARME'97), (Montréal, Québec, Canada), pp. 203-213, Springer-Verlag, October 1997.
22. T. Filkorn, "A method for symbolic verification of synchronous circuits," in Proceedings of 10th IFIP Symposium on Computer Hardware Description Languages (CHDL'91),1991.
23. C. van Eijk, "Sequential equivalence checking based on structural similarities," IEEE Transactions on Computer-Aided Design, vol. 19, July 2000.
24. D. Stoffel and W. Kunz, "A structural fixpoint iteration for sequential logic equivalence checking based on retiming," in International Workshop on Logic Synthesis, (Tahoe City, CA), May 1997.
25. G. Cabodi, S. Quer, and F. Somenzi, "Optimizing sequential verification by retiming transformations," in Proceedings of the 37th ACM/IEEE Design Automation Conference, (Los Angeles), pp. 601-606, June 2000.
26. A. Kuehlmann and J. Baumgartner, "Transformation-based verification using generalized retiming," in Computer Aided Verificaiion, (Paris, France), pp. 104-117, July 2001.
27. O. Coudert, C. Berthet, and J. C. Madre, "Verification of sequential machines using Boolean functional vectors," in IMEC-IFIP International Workshop on Applied Formal Methods for Correct VLSI Design, pp. 111-128, November 1989.
28. O. Coudert, C. Berthet, and J. C. Madre, "Verification of synchronous sequential machines based on symbolic execution," in International Workshop on Automatic Verification Methods for Finite State Systems, (Grenoble, France), Springer-Verlag, June 1989.
29. H. J. Touati, H. Savoj, B. Lin, R. K. Brayton, and A. Sangiovanni-Vincentelli, "Implicit state enumeration for finite state machines using BDD's," in Digest of Technical Papers of the IEEE International Conference on Computer-Aided Design, pp. 130-133, November 1990.
30. D. Stoffel and W. Kunz, "Record and play: a structural fixed point iteration for sequential circuit verification," in Digest of Technical Papers of the IEEE/ACM International Conference on Computer-Aided Design, (San Jose, California), pp. 394-399, November 1997.