Refinement strategies for verification methods based on datapath abstraction

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn 2006, Issue , 2006, Pages 19-24

  Andraus, Zaer S ^a   Liffiton, Mark H ^a   Sakallah, Karem A ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; BENCHMARKING; MATHEMATICAL MODELS; MICROPROCESSOR CHIPS;

COUNTER-EXAMPLE-GUIDED ABSTRACTION REFINEMENT (CEGAR); DATAPATH ABSTRACTION; MINIMAL UNSATISFIABLE SUBSET (MUS); MUS EXTRACTION;

DATA ACQUISITION;

EID: 33748597091     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1118299.1118306     Document Type: Conference Paper

References (25)

1. W. Ackerman, "Solvable Cases of the Decision Problem." North-Holland, Amsterdam, 1954.
2. st Design Automation Conference 2004, pp. 218-223.
3. C. Barrett, D. Dill, and J. Levitt, "Validity checking for combinations of theories with equality". In FMCAD96, LNCS 1166, pp. 187-201.
4. 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", FMCAD02.
5. S. Das and D. Dill, "Successive Approximation of Abstract Transition Relations" in 16th Annual IEEE Symposium on Logic in Computer Science (LICS) 2001.
6. R. E. Bryant, S. K. Lahiri, S. A. Seshia, "Modeling and Verifying Systems using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions". In Proc. CAV, July 2002.
7. R. E. Bryant, S. German, and M. N. Velev, "Exploiting positive equality in a logic of equality with uninterpreted functions". ACM Transactions on Computational Logic, 2(1):93-134, January 2001.
8. J. R. Burch and D. L. Dill, "Automatic Verification of Pipelined Microprocessor Control". CAV '94, D. L. Dill, ed., LNCS 818, Springer-Verlag, June 1994, pp. 68-80.
9. E. Clarke, O. Grumberg, S. Jha, Y. Lu and H. Veith, "Counterexample- Guided Abstraction Refinement," In CAV 2000, pp. 154-169.
10. N. Een and A. Biere, "Improved Subsumption Techniques for Variables Elimination in SAT," SAT 2005.
11. S. Graf and H. Saidi, "Construction of abstract state graphs with PVS," In CAV, volume 1254, pp. 72-83, 1997.
12. A. Gupta, M. Ganai, Z. Yang, and P. Ashar, "Iterative Abstraction Using SAT-based BMC with Proof Analysis." In Proc. of the International Conference on CAD, pp. 416-423, Nov. 2003.
13. J. L. Hennessy and D. A. Patterson, "Computer Architecture: A Quantitative Approach", Morgan Kaufmann, 1990.
14. H. Jain, D. Kroening and E. Clarke, "Predicate Abstraction and Verification of Verilog," Technical Report CMU-CS-04-139.
15. M. Kaufmann and J. Moore, "An Industrial Strength Theorem Prover for a Logic Based on Common Lisp." IEEE Transactions on Software Engineering 23(4), April 1997, pp. 203-213.
16. R. Kurshan, "Computer-Aided Verification of Coordinating Processes: The Automata-Theoritic Approach," Princ eton University Press, 1999.
17. D. Kroening, E. Clarke and K. Yorav, "Behavioral Consistency of C and Verilog Programs with Bounded Model Checking," in 40th DAC, 2003, pp. 368-342.
18. S. K. Lahiri, S. A. Seshia, R. E. Bryant, "Modeling and Verification of Out-of-Order Microprocessors in UCLID", FMCAD 2002.
19. M. H. Liffiton, M. D. Moffitt, M. E. Pollack, and K. A. Sakallah, "Identifying Conflicts in Overconstrained Temporal Problems," in Proc. 19th International Joint Conference on Artificial Intelligence (IJCAI-05), pp. 205-211, Edinburgh, Scotland, 2005.
20. 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), pp. 2-17, Warsaw, Poland, April, 2003, LNCS 2619.
21. S. A. Seshia, S. K. Lahiri, R. E. Bryant, "A User's Guide to UCLID version 0.1".
22. D. E. Thomas and P. R. Moorby, "The Verilog Hardware Description Language", Kluwer Academic Publishers, Nowell, Massachusetts, 1991.
23. L. Zhang and S. Malik, "Extracting Small Unsatisfiable Cores from Unsatisfiable Boolean Formulas." In SAT, Springer-Verlag, 2003.
24. www-2.cs.cmu.edu/~uclid
25. vlsi.colorado.edu/~vis