Efficient modeling of embedded memories in bounded model checking

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

Volumn 3114, Issue , 2004, Pages 440-452

  Ganai, Malay K ^a   Gupta, Aarti ^a   Ashar, Pranav ^a  

^a NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER AIDED ANALYSIS; FORMAL LOGIC; MEMORY ARCHITECTURE; SEMANTICS; SOFTWARE DESIGN;

ABSTRACT INTERPRETATIONS; ABSTRACT MODELING; BOUNDED MODEL CHECKING; EXPLICIT MODELING; HARDWARE AND SOFTWARE DESIGNS; MEMORY INTERFACE; MEMORY LOCATIONS; MEMORY MODELING;

MODEL CHECKING;

EID: 35048817084     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27813-9_34     Document Type: Article

References (28)

1. A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu, "Symbolic model checking using SAT procedures instead of BDDs," in Proceedings of the Design Automation Conference, 1999, pp. 317-320.
2. P. Bjesse and K. Claessen, "SAT-based verification without state space traversal," in Proceedings of Conference on Formal Methods in Computer-Aided Design, 2000.
3. M. Ganai and A. Aziz, "Improved SAT-based Bounded Reachability Analysis," in Proceedings of VLSI Design Conference, 2002.
4. P. A. Abdulla, P. Bjesse, and N. Een, "Symbolic Reachability Analysis based on {SAT}-Solvers," in Proceedings of Workshop on Tools and Algorithms for the Analysis and Construction of Systems (TACAS), 2000.
5. E. M. Clarke, O. Grumberg, and D. Peled, Model Checking: MIT Press, 1999.
6. K. L. McMillan, Symbolic Model Checking: An Approach to the State Explosion Problem: Kluwer Academic Publishers, 1993.
7. J. P. Marques-Silva and K. A. Sakallah, "GRASP: A Search Algorithm for Prepositional Satisfiability," IEEE Transactions on Computers, vol. 48, pp. 506-521, 1999.
8. H. Zhang, "SATO: An efficient prepositional prover," in Proceedings of International Conference on Automated Deduction, vol. 1249, LNAI, 1997, pp. 272-275.
9. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an Efficient SAT Solver," in Proceedings of Design Automation Conference, 2001.
10. M. Ganai, L. Zhang, P. Ashar, and A. Gupta, "Combining Strengths of Circuit-based and CNF-based Algorithms for a High Performance SAT Solver," in Proceedings of the Design Automation Conference, 2002.
11. A. Kuehlmann, M. Ganai, and V. Paruthi, "Circuit-based Boolean Reasoning," in Proceedings of Design Automation Conference, 2001.
12. J. R. Burch and D. L. Dill, "Automatic verification of pipelined microprocessor control," in Proceedings of the sixth International Conference on Computer-Aided Verification, vol. 818. D. L. Dill, Ed.: Springer-Verlag, 1994, pp. 68-80.
13. D. E. Long, "Model checking, abstraction and compositional verification," Carnegie Mellon University, 1993.
14. R. P. Kurshan, Computer-Aided Verification of Co-ordinating Processes: The Automata-Theoretic Approach: Princeton University Press, 1994.
15. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, "Counterexample-guided abstraction refinement," in Proceedings of CAV, vol. 1855. LNCS, 2000, pp. 154-169.
16. E. M. Clarke, A. Gupta, J. Kukula, and O. Strichman, "SAT based abstraction-refinement using ILP and machine learning techniques," in Proceedings of CAV, 2002.
17. D. Wang, P.-H. Ho, J. Long, J. Kukula, Y. Zhu, T. Ma, and R. Damiano, "Formal Property Verification by Abstraction Refinement with Formal, Simulation and Hybrid Engines," in 38th Design Automation Conference, 2001.
18. P. Chauhan, E. M. 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 Proceedings of FMCAD, 2002.
19. K. McMillan and N. Amla, "Automatic Abstraction without Counterexamples," in Tools and Algorithms for the Construction and Analysis of Systems, April 2003.
20. A. Gupta, M. Ganai, P. Ashar, and Z. Yang, "Iterative Abstraction using SAT-based BMC with Proof Analysis," in Proceedings of International Conference on Computer-Aided Design, 2003.
21. M. N. Velev, R. E. Bryant, and A. Jain, "Efficient Modeling of Memory Arrays in Symbolic Simulation," in ComputerAided Verification, O. Grumberg, Ed., 1997, pp. 388-399.
22. R. E. Bryant, S. German, and M. N. Velev, "Processor Verification Using Efficient Reductions of the Logic of Uninterpreted Functions to Prepositional Logic," in Computer-Aided Verification, N. Halbwachs and D. Peled, Eds.: Springer-Verlag, 1999, pp. 470-482.
23. M. N. Velev, "Automatic Abstraction of Memories in the Formal Verification of Superscalar Microprocessors," in Proceedings of Tools and Algorithms for the Construction and Analysis of Systems, 2001, pp. 252-267.
24. S. K. Lahiri, S. A. Seshia, and R. E. Bryant, "Modeling and Verification of Out-of-Order Microprocessors in UCLID," in Proceedings of Formal Methods in Computer-Aided Design, 2002, pp. 142-159.
25. R. E. Bryant, S. K. Lahiri, and S. A. Seshia, "Modeling and Verifying Systems using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions," in Computer-Aided Verification, 2002.
26. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu, "Symbolic Model Checking without BDDs," in Proceedings of Workshop on Tools and Algorithms for Analysis and Construction of Systems (TACAS), vol. 1579, LNCS, 1999.
27. M. Sheeran, S. Singh, and G. Stalmarck, "Checking Safety Properties using Induction and a SAT Solver," in Proceedings of Conference on Formal Methods in Computer-Aided Design, 2000.
28. S. Pilarski and G. Hu, "Speeding up SAT for EDA," in Proceedings of Design Automation and Test in Europe, 2002, pp. 1081.