LPSAT: A unified approach to RTL satisfiability

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 2001, Pages 398-402

  Zeng, Zhihong ^a   Kalla, Priyank ^a   Ciesielski, Maciej ^a  

^a University of Massachusetts   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN LOGIC; CONSTRAINT PROPAGATION; MIXED INTEGER LINEAR PROGRAM; OVERALL EFFICIENCY; SATISFIABILITY; SOLVE THE SATISFIABILITY; TWO DOMAINS; UNIFIED APPROACH;

EXHIBITIONS; FORMAL LOGIC; INTEGER PROGRAMMING;

DESIGN;

EID: 84893652372     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2001.915055     Document Type: Conference Paper

References (21)

1. M. Davis and H. Putnam, "A Computing Procedure for Quantification Theory", Journal of the ACM, vol. 7, pp. 201-215, 1960.
2. C. E. Blair and et al., "Some Results and Experiments in Programming Techniques for Propositional Logic", Comp. and Oper. Res., vol. 13, no. 5, pp. 633-645, 1986.
3. J. W. Freeman, "Improvements to Propositional Satisfiability Search Algorithms", Ph. D. Dissertation, Dept. of Comp. and Inf. Sc, Univ. of Penn., May 1995.
4. T. Larabee, Efficient Generation of Test Patterns using Satisfiability, Ph. D. Thesis, Dept. of Computer Science, Stanford University, Feb. 1990.
5. P. R. Stephan, R. K. Brayton, and A. L. Sangiovanni-Vincentelli, "Combinational Test Generation using Satisfiability", Tech. Rep. UCB/ERL M92/112, Dept. of EECS., Univ. of California al Berkeley, Oct. 1992.
6. R. Zabih and D. A. McAllester, "A Rearrangement Search Strategy for Determining Propositional Satisfiability", in Proc. Natl. Conf. on Al, 1988.
7. J. Marques-Silva and K. A. Sakallah, "GRASP - A New Search Algorithm for Satisfiability", in ICCAD'96, 1996, pp. 220-227.
8. L. G. Silva, L. M. Silvera, and J. Marques-Silva, "Algorithms for Solving Boolean Satisfiability in Combinational Circuits", in Proc. DATE, March 1999, pp. 526-530.
9. R. E. Bryant, "Graph Based Algorithms for Boolean Function Manipulation", IEEE Transactions on Computers, vol. C-35, pp. 677-691, August 1986.
10. K. S. Brace, R. Rudell, and R. E. Bryant, "Efficient Implementation of the BDD Package", Proceedings of the Design Automation Conference, pp. 40-45, 1990.
11. S. Jeong and F. Somenzi, "A New Algorithm for the Binate Covering Problem and its Application to the Minimization of Boolean Relations", in ICCAD, 92.
12. B. Lin and F. Somenzi, "Minimization of Symbolic Relations", in ICCAD, 90.
13. T. Villa and et al., "Explicit and Implicit Algorithms for Binate Covering Problems", IEEE Trans. CAD, vol. Vol. 16, no. No. 7, pp. 677-691, July 1997.
14. P. Kalla, Z. Zeng, M. J. Ciesielski, and C. Huang, "A BDD-Based Satisfiability Infrastructure using the Unate Recursive Paradigm", in Proc. of DATE 2000, 2000, pp. 232-236.
15. F. Fallah, S. Devadas, and K. Keutzer, "Functional Vector Generation for HDL models using Linear Programming and 3-Satisfiability", in Proc. DAC, 1998, pp. 528-533.
16. R. Vemuri and R. Kalyanaraman, "Generation of design verification tests from behavioral VHDL programs using path enumeration and constraint programming", IEEE Tran. on VLSI Systems, vol. 3, no. 2, pp. 201-214, June 1995.
17. A. K. Chandra and V. S. Iyengar, "Constraint solving for test case generation: a technique for high-level design verification", in Proc. of Int'l Conf. on Computer Design: VLSI in Computers and Processors, 1992, pp. 245-248.
18. F. Fallah, Coverage Directed Validation of Hardware Models, Ph. D. Thesis, MIT, 1999.
19. R. K. Brayton, G. D. Hachtel, A. Sangiovanni-Vencentelli, F. Somenzi, A. Aziz, S-T. Cheng, S. Edwards, S. Khatri, Y. Kukimoto, A. Pardo, S. Qadeer, R. Ranjan, S. Sarwary, G. Shiple, S. Swamy, and T. Villa, "Vis: A system for verification and synthesis", Proceedings of the Computer Aided Verification Conference, 1996.
20. CPLEX Reference Manual, ILOG, 1999.
21. H. Zhang, "Sato: An efficient propositional prover", in Proc. of 14th Conference on Automated Deduction, 1997, pp. 272-275.