메뉴 건너뛰기




Volumn 17, Issue , 2004, Pages 585-590

Can SAT be used to improve sequential ATPG methods ?

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATIONAL EQUIVALENCE CHECKING; DESIGN VERIFICATION; ITERATIVE LOGIC ARRAY (ILA);

EID: 2342586655     PISSN: 10639667     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (8)

References (33)
  • 1
    • 84863944806 scopus 로고    scopus 로고
    • Symbolic reachability analysis based on SAT-Solvers
    • March
    • P. A. Abdulla, P. Bjesse, and N. Eén. Symbolic Reachability Analysis Based on SAT-Solvers. In TACAS, pages 411-425, March 2000.
    • (2000) TACAS , pp. 411-425
    • Abdulla, P.A.1    Bjesse, P.2    Eén, N.3
  • 3
    • 0029373707 scopus 로고
    • Combinational ATPG theorems for identifying untestable faults in sequential circuits
    • Sept.
    • V. D. Agrawal and S. T. Chakradhar. Combinational ATPG Theorems for Identifying Untestable Faults in Sequential Circuits. IEEE Trans. on CAD, 14(9):1155-1160, Sept. 1995.
    • (1995) IEEE Trans. on CAD , vol.14 , Issue.9 , pp. 1155-1160
    • Agrawal, V.D.1    Chakradhar, S.T.2
  • 4
    • 84944319371 scopus 로고    scopus 로고
    • Symbolic model checking without BDDs
    • March
    • A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic Model Checking without BDDs. In TACAS, pages 193-207, March 1999.
    • (1999) TACAS , pp. 193-207
    • Biere, A.1    Cimatti, A.2    Clarke, E.M.3    Zhu, Y.4
  • 7
    • 84893808653 scopus 로고    scopus 로고
    • BerkMin: A fast and robust sat-solver
    • March
    • E. Goldberg and Y. Novikov. BerkMin: a Fast and Robust Sat-Solver. In Proc. of DATE, pages 142-149, March 2002.
    • (2002) Proc. of DATE , pp. 142-149
    • Goldberg, E.1    Novikov, Y.2
  • 8
    • 0042593196 scopus 로고    scopus 로고
    • PROFTEST: A property-based test generator for synchronous sequential circuits
    • August
    • R. Guo, S. M. Reddy, and I. Pomeranz. PROFTEST: A Property-Based Test Generator for Synchronous Sequential Circuits. IEEE Trans. on CAD, 22(8):1080-1091, August 2003.
    • (2003) IEEE Trans. on CAD , vol.22 , Issue.8 , pp. 1080-1091
    • Guo, R.1    Reddy, S.M.2    Pomeranz, I.3
  • 10
    • 0029755103 scopus 로고    scopus 로고
    • Alternating strategies for sequential circuit ATPG
    • March
    • M. S. Hsiao, E. M. Rudnick, and J. H. Patel. Alternating strategies for sequential circuit ATPG. In Proc. of ED & TC, pages 368-374, March 1996.
    • (1996) Proc. of ED & TC , pp. 368-374
    • Hsiao, M.S.1    Rudnick, E.M.2    Patel, J.H.3
  • 11
    • 0030652729 scopus 로고    scopus 로고
    • Sequential circuit test generation using dynamic state traversal
    • March
    • M. S. Hsiao, E. M. Rudnick, and J. H. Patel. Sequential Circuit Test Generation Using Dynamic State Traversal. In Proc. of ED & TC, pages 22-28, March 1997.
    • (1997) Proc. of ED & TC , pp. 22-28
    • Hsiao, M.S.1    Rudnick, E.M.2    Patel, J.H.3
  • 15
    • 0026623575 scopus 로고
    • Test pattern generation using boolean satisfiability
    • Jan
    • T. Larrabee. Test Pattern Generation Using Boolean Satisfiability. IEEE Trans. on CAD, 11(1):4-15, Jan 1992.
    • (1992) IEEE Trans. on CAD , vol.11 , Issue.1 , pp. 4-15
    • Larrabee, T.1
  • 16
    • 0033328173 scopus 로고    scopus 로고
    • Techniques for improving the efficiency of sequential circuit test generation
    • Nov.
    • X. Lin, I. Pomeranz, and S. M. Reddy. Techniques for Improving the Efficiency of Sequential Circuit Test Generation. In Proc. of ICCAD, pages 147-151, Nov. 1999.
    • (1999) Proc. of ICCAD , pp. 147-151
    • Lin, X.1    Pomeranz, I.2    Reddy, S.M.3
  • 18
    • 0032680865 scopus 로고    scopus 로고
    • GRASP: A search algorithm for propositional satisfiability
    • May
    • J. P. Marques-Silva and K. A. Sakallah. GRASP: A Search Algorithm for Propositional Satisfiability. IEEE Trans. on Computers, 48(5):506-521, May 1999.
    • (1999) IEEE Trans. on Computers , vol.48 , Issue.5 , pp. 506-521
    • Marques-Silva, J.P.1    Sakallah, K.A.2
  • 21
    • 0027072656 scopus 로고
    • HITEC: A test generation package for sequential circuits
    • Feb.
    • T. Niermann and J. H. Patel. HITEC: A test generation package for sequential circuits. In Proc. of EDAC, pages 214-218, Feb. 1991.
    • (1991) Proc. of EDAC , pp. 214-218
    • Niermann, T.1    Patel, J.H.2
  • 23
    • 84893713000 scopus 로고    scopus 로고
    • Using SAT for combinational equivalence checking
    • March
    • M. R. Prasad, E. I. Goldberg, and R. K. Brayton. Using SAT for Combinational Equivalence Checking. In Proc. of DATE, pages 114-121, March 2001.
    • (2001) Proc. of DATE , pp. 114-121
    • Prasad, M.R.1    Goldberg, E.I.2    Brayton, R.K.3
  • 24
    • 2342499037 scopus 로고    scopus 로고
    • New procedures for identifying undetectable and redundant faults in synchronous sequential circuits
    • April
    • S. M. Reddy, I. Pomeranz, X. Lin, and N. Z. Basturkmen. New Procedures for Identifying Undetectable and Redundant Faults In Synchronous Sequential Circuits. In Proc. of VTS, April 1999.
    • (1999) Proc. of VTS
    • Reddy, S.M.1    Pomeranz, I.2    Lin, X.3    Basturkmen, N.Z.4
  • 25
    • 0029223036 scopus 로고
    • Combining deterministic and genetic approaches for sequential circuit test generation
    • June
    • nd DAC, pages 183-188, June 1995.
    • (1995) nd DAC , pp. 183-188
    • Rudnick, E.M.1    Patel, J.H.2
  • 27
    • 70350787997 scopus 로고    scopus 로고
    • Checking safety properties using induction and a SAT-solver
    • W. A. Hunt and S. D. Johnson, editors, Nov.
    • M. Sheeran, S. Singh, and G. Stålmarck Checking safety properties using induction and a SAT-solver. In W. A. Hunt and S. D. Johnson, editors, Proc. of FMCAD, volume 1954, pages 108-125, Nov. 2000.
    • (2000) Proc. of FMCAD , vol.1954 , pp. 108-125
    • Sheeran, M.1    Singh, S.2    Stålmarck, G.3
  • 29
    • 84944402340 scopus 로고    scopus 로고
    • Tuning SAT checkers for bounded model checking
    • O. Shtrichman. Tuning SAT Checkers for Bounded Model Checking. In Proc. of CAV, pages 480-494, 2000.
    • (2000) Proc. of CAV , pp. 480-494
    • Shtrichman, O.1
  • 30
    • 14644420727 scopus 로고    scopus 로고
    • Pruning techniques for the SAT-based bounded model checking problem
    • Sept.
    • O. Shtrichman. Pruning Techniques for the SAT-based Bounded Model Checking Problem. In Proc. of CHARME, Sept. 2001.
    • (2001) Proc. of CHARME
    • Shtrichman, O.1
  • 32
    • 0036911404 scopus 로고    scopus 로고
    • Conflict driven techniques for improving deterministic test pattern generation
    • Nov.
    • C. Wang, S. M. Reddy, I. Pomeranz, X. Lin, and J. Rajski. Conflict Driven Techniques for Improving Deterministic Test Pattern Generation. In Proc. of ICCAD, pages 87-93, Nov. 2002.
    • (2002) Proc. of ICCAD , pp. 87-93
    • Wang, C.1    Reddy, S.M.2    Pomeranz, I.3    Lin, X.4    Rajski, J.5
  • 33
    • 84937410369 scopus 로고    scopus 로고
    • SATO: An efficient propositional prover
    • July
    • H. Zhang. SATO: An Efficient Propositional Prover. In Proc. of CADE, pages 272-275, July 1997.
    • (1997) Proc. of CADE , pp. 272-275
    • Zhang, H.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.