Exploiting signal unobservability for efficient translation to CNF in formal verification of microprocessors

Proceedings - Design, Automation and Test in Europe Conference and Exhibition

Volumn 1, Issue , 2004, Pages 266-271

  Velev, Miroslav N ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN CIRCUIT; CONJUNCTIVE NORMAL FORM (CNF); TAUTOLOGY; UNINTERPRETED FUNCTION (UF); BOOLEAN FORMULAE; DECISION PROCEDURE; FORMAL VERIFICATIONS; LOGIC OF EQUALITY WITH UNINTERPRETED FUNCTIONS AND MEMORY (EUFM); OUTPUT VARIABLES; TRANSLATION STRATEGIES; UNOBSERVABILITY;

BOOLEAN FUNCTIONS; COSTS; FORMAL LOGIC; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; TREES (MATHEMATICS); EQUIVALENT CIRCUITS; EXHIBITIONS; MICROPROCESSOR CHIPS;

MICROPROCESSOR CHIPS; BOOLEAN ALGEBRA;

EID: 3042660498     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2004.1268859     Document Type: Conference Paper

References (74)

1. M. Abramovici, M.A. Breuer, and A.D. Friedman, Digital Systems Testing and Testable Design, revised edition, IEEE Press, New York, 1990.
2. W. Ackermann, Solvable Cases of the Decision Problem, North-Holland, Amsterdam, 1954.
3. M. Alekhnovich, and A.A. Razborov, "Satisfiability, Branch-Width and Tseitin Tautologies," Foundations of Computer Science (FOCS'02), November 2002, pp. 593-603.
4. F.A. Aloul, I.L. Markov, and K.A. Sakallah, "Faster SAT and Smaller BDDs via Common Function Structure," International Conference on Computer-Aided Design (ICCAD'01), November 2001, pp. 443-448.
5. th International Conference on Theory and Applications of Satisfiability Testing (SAT'03), May 2003.
6. C. Barrett, D. Dill, and A. Stump, "Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT," Computer-Aided Verification (CAV '02), LNCS 2404, Springer-Verlag, July 2002, pp. 236-249.
7. M. Bauer, D. Brand, M. Fischer, A. Meyer, and M. Paterson, "A Note on Disjunctive Form Tautologies," SIGACT News, Vol. 4 (1973), pp. 17-20.
8. J.D. Bingham, and A.J. Hu, "Semi-Formal Bounded Model Checking," Computer-Aided Verification (CAV '02), LNCS 2404, Springer-Verlag, July 2002.
9. T. Boy de la Tour, "An Optimality Result for Clause Form Translation," Journal of Symbolic Compulation, Vol. 14 (1992), pp. 283-301.
10. R.I. Brafman, "A Simplifier for Propositional Formulas with Many Binary Clauses," Int'l. Joint Conference on Artificial Intelligence (IJCAI '01), 2001.
11. th Int'l Conference on Theory and Applications of Satisfiability Testing (SAT '03), May 2003.
12. R.E. Bryant, "Graph-Based Algorithms for Boolean Function Manipulation," IEEE Transactions on Computers, Vol. C-35, No. 8 (August 1986), pp. 677-691.
13. R.E. Bryant, S. German, and M.N. Velev, "Processor Verification Using Efficient Reductions of the Logic of Uninterpreted Functions to Propositional Logic," ACM Transactions on Computational Logic trb(TOCL), Vol. 2, No. 1 (January 2001), pp. 93-134.
14. R.E. Bryant, and M.N. Velev, "Boolean Satisfiability with Transitivity Constraints," ACM Transactions on Computational Logic (TOCL), Vol. 3, No. 4 (October 2002), pp. 604-627.
15. J.R. Burch, and D.L. Dill, "Automated Verification of Pipelined Microprocessor Control," Computer-Aided Verification (CAV'94), LNCS 818, Springer-Verlag, June 1994.
16. rd Design Automation Conference (DAC '96), June 1996, pp. 552-557.
17. H.K. Büning, and T. Lettmann, Propositional Logic: Deduction and Algorithms, Cambridge Tracts in Theoretical Computer Science 48, Cambridge University Press, 1999.
18. E.M. Clarke, and O. Sirichman, "A Failed Attempt to Optimize Variable Ordering with Tools for Constraint Solving," Workshop on Constraints in Formal Verification (CFV '02), 2002.
19. th National Conference on Artificial Intelligence, 1993, pp. 21-27. http://citeseer.nj.nec. com/crawford93experitnental.html
20. M. Damiani, and G. De Micheli, "Observability Don't Care Sets and Boolean Relations," International Conference on Computer-Aided Design (ICCAD '90), November 1990.
21. E. Eder, "An Implementation of a Theorem Prover Based on the Connection Method," Artificial Intelligence: Methodology, Systems, Applications (AIMSA '84), 1985.
22. th International Conference on Automated Deduction (CADE '96), M. McRobbie, and J. Slaney, eds., LNCS 1104, July-August 1996.
23. J. Franco, M. Kouril, J. Schlipf, J. Ward, S. Weaver, M. Dransfield, and W.M. Vanfleet, "SBSAT: A State Based, BDD-Based Satisfiability Solver," 6 International Conference on Theory and Applications of Satisfiability Testing (SAT '03), May 2003.
24. M.K. Ganai, L. Zhang, P. Ashar, A. Gupta, S. Malik, "Combining Strengths of Circuit-Based and CNF-Based Algorithms for a High-Performance SAT Solver," 39 Design Automation Conference (DAC '02), June 2002.
25. A. Goel, K. Sajid, H. Zhou, A. Aziz, and V. Singhai, "BDD Based Procedures for a Theory of Equality with Uninterpreted Functions," Computer-Aided Verification (CAV '98), LNCS 1427, Springer-Verlag, June 1998, pp. 244-255.
26. E. Goldberg, and Y. Novikov, "BerkMin: A Fast and Robust Sat-Solver," Design, Automation, and Test in Europe (DATE '02), March 2002, pp. 142-149.
27. E. Goldberg, and Y. Novikov, Personal Communication, June 2003.
28. th Design Automation Conference (DAC '01). June 2001, pp. 536-541.
29. G Hasteer, Personal Communication, February 1999.
30. rd edition, Morgan Kaufmann, San Francisco, 2002.
31. D.S. Johnson, and M.A. Trick, eds., The Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, http://dimacs.rutgers.edu/challenges
32. R.B. Jones, D.L. Dill, and J.R. Burch, "Efficient Validity Checking for Processor Verification," International Conference on Computer-Aided Design (ICCAD '95), 1995
33. st International Conference on Computational Logic (CL '00), LNAI 1861, Springer-Verlag, July 2000.
34. th Design Automation Conference (DAC '87). June 1987.
35. th Design Automation Conference (DAC '02), June 2002.
36. th Design Automation Conference (DAC '01), June 2001, pp. 232-237.
37. S. Lahiri, C. Pixley, and K. Albin, "Experience with Term Level Modeling and Verification of the M·CORE Microprocessor Core," International Workshop on High Level Design, Validation and Test (HLDVT '01), November 2001.
38. S.K. Lahiri, S.A. Seshia, and R.E. Bryant, "Modeling and Verification of Out-of-Order Microprocessors in UCLID," Formal Methods in Computer-Aided Design (FMCAD '02), LNCS 2517, Springer-Verlag, November 2002.
39. S.K. Lahiri, and R.E. Bryant, "Deductive Verification of Advanced Out-of-Order Microprocessors," Computer-Aided Verification (CAV '03), LNCS, Springer-Verlag, July 2003.
40. T. Larrabee, "Test Pattern Generation Using Boolean Satisfiability," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD), Vol. 11, No. 1 (January 1992), pp. 4-15.
41. D. Le Berre, "Exploiting the Real Power of Unit Propagation Lookahead," Workshop on Theory and Applications of Satisfiability Testing (SAT '01), H. Kautz, and B. Selman, eds., Elsevier Science Publishers, Electronic Notes in Discrete Mathematics, Vol. 9, June 2001.
42. th International Conference on Theory and Applications of Satisfiability Testing (SAT '03), 2003. http://www.lri.fr/ ~simon/contest03/results/
43. J. Levin, and K. Olukotun, "Verifying Correct Pipeline Implementation for Microprocessors," International Conference on Computer-Aided Design (ICCAD '97), 1997.
44. rd International Conference on Principles and Practice of Constraint Programming (CP '97), Springer-Verlag, LNCS 1330, 1997, pp. 342-356.
45. th Design Automation Conference (DAC '03), June 2003.
46. th IEEE International Conference on Tools with Artificial Intelligence (ICTAI '03), November 2003.
47. S. Malik, A.R. Wang, R.K. Brayton, and A. Sangiovani-Vincentelli, "Logic Verification Using Binary Decision Diagrams in a Logic Synthesis Environment," International Conference on Computer-Aided Design (ICCAD '88), November 1988.
48. J.P. Marques-Silva, "Algebraic Simplification Techniques for Prepositional Satisfiability," Principles and Practice of Constraint Programming (CP '00), Rina Dechter, ed., LNCS 1894, Springer-Verlag, September 2000.
49. th Design Automation Conference (DAC '01), June 2001.
50. R. Ostrowski, E. Grégoire, B. Mazure, and L. Saïs, "Recovering and Exploiting Structural Knowledge from CNF Formulas," Principles and Practice of Constraint Programming (CP '02), P. Van Hentenryck, ed., LNCS 2470, Springer-Verlag, September 2002, pp. 185-199.
51. D.A. Plaisted, and S. Greenbaum, "A Structure Preserving Clause Form Translation," Journal of Symbolic Computation (JSC), Vol. 2, 1985, pp. 293-304.
52. A. Pnueli, Y. Roden, O. Strichman, and M. Siegel, "The Small Model Property: How Small Can It Be?", Journal of Information and Computation, Vol. 178, No. 1 (October 2002).
53. L. Ryan, Siege SAT Solver v.3. http://www.cs.sfu.ca/~loryan/personal/
54. H. Savoj, and R.K. Brayton, "The Use of Abservability and External Don't Cares for the Simplification of Multi-Level Networks," Design Automation Conference (DAC '00), June 1990.
55. S.A. Seshia, S.K. Lahiri, and R.E. Bryanf, "A Hybrid SAT-Based Decision Procedure for Separation Logic with Uninterpreted Functions," Design Automation Conference (DAC '03), June 2003, pp. 425-430.
56. O. Shacham, and E. Zaipas, "Tuning the VSIDS Decision Heuristic for Bounded Model Checking." Microprocessor Test and Verification (MTV '03), May 2003.
57. G.S. Tseilin, "On the Complexity of Derivation in Prepositional Calculus," in Studies in Constructive Mathematics and Mathematical Logic, Part 2, 1968, pp. 115-125. Reprinted in J. Sickmann, and G. Wrightson, eds., Automation of Reasoning, Vol. 2, Springer-Verlag, 1983.
58. G.S. Tseilin, "On the Complexity of Derivation in Prepositional Calculus," in Studies in Constructive Mathematics and Mathematical Logic, Part 2, 1968, pp. 115-125. Reprinted in J. Sickmann, and G. Wrightson, eds., Automation of Reasoning, Vol. 2, Springer-Verlag, 1983.
59. O. Tveretina, and H. Zantema, "A Proof System and a Decision Procedure for Equality Logic," Technical Report, Department of Computer Science, Technical University of Eindhoven, 2003. http://www.win.tue.nl/- hzantema/TZ.pdf
60. M.N. Velev, and R.E. Bryant, "Efficient Modeling of Memory Arrays in Symbolic Ternary Simulation," Tools and Algorithms for the Construction and Analysis of Systems (TACAS '98), B. Steffen, ed., LNCS 1384, Springer-Verlag, March-April 1998.
61. M.N. Vetev, and R.E. Bryant, "Incorporating Timing Constraints in the Efficient Memory Model for Symbolic Ternary Simulation," International Conference on Computer Design (ICCD '98), October 1998, pp. 400-406.
62. M.N. Velev, and R.E. Bryant, "Bit-Level Abstraction in the Verification of Pipelined Microprocessors by Correspondence Checking," Formal Methods in Computer-Aided Design (FMCAD '98), LNCS 1522, Springer-Verlag, November 1998, pp. 18-35.
63. th Design Automation Conference (DAC '99), June 1999, pp. 397-401.
64. M.N. Velev, and R.E. Bryant. "Superscalar Processor Verification Using Efficient Reductions of the Logic of Equality with Uninterpreted Functions to Prepositional Logic," Correct Hardware Design and Verification Methods (CHARME '99), LNCS 1703, Springer-Verlag, September 1999, pp. 37-53.
65. th Design Automation Conference (DAC '00), June 2000, pp. 112-117.
66. M.N. Velev, "Formal Verification of VLIW Microprocessors with Speculative Execution," Computer-Aided Verification (CAV '00), LNCS 1855, Springer-Verlag, July 2000.
67. M.N. Velev, "Automatic Abstraction of Memories in the Formal Verification of Superscalar Microprocessors," Tools und Algorithms for the Construction and Analysis of Systems (TACAS '010), T. Margaria, and W. Yi, eds., LNCS 2031, Springer-Verlag, April 2001, pp. 252-267.
68. M.N. Velev, and R.E. Bryant, "EVC: A Validity Checker for the Logic of Equality with Uninterpreted Functions and Memories, Exploiting Positive Equality and Conservative Transformations," Computer-Aided Verification (CAV '01), LNCS 2102, Springer-Verlag, July 2001.
69. M.N. Velev, and R.E. Bryant, "Effective Use of Boolean Satisfiability Procedures in the Formal Verification of Superscalar and VLIW Microprocessors," Journal of Symbolic Computation (JSC), Vol. 35, No. 2 (February 2003), pp. 73-106.
70. M.N. Velev, "Automatic Abstraction of Equations in a Logic of Equality," Automated Reasoning with Analytic Tableaux, and Related Methods (TABLEAUX '03), M.C. Mayer, and F. Pirri, eds., LNAI 2796, Springer-Verlag, September 2003, pp. 189-206.
71. M.N. Velev, "Efficient Translation of Boolean Formulas to CNF in Formal Verification of Microprocessors." Asia and South Pacific Design Automation Conference (ASP-DAC '04), January 2004.
72. D. Wang, E. Clarke, Y. Zhu, and J. Kukula, "Using Cutwidth to Improve Symbolic Simulation and Boolean Satisfiability," IEEE International High Level Design Validation and Test Workshop (HLDVT '01), 2001.
73. th International Workshop on First Order Theorem Proving (FTP '03), June 2003. http://www.win.nie.nl/~jfg/articles/CS- Repon03-05.pdf
74. th International Conference on Theory and Applications of Satisfiability Testing (SAT '03), May 2003.