메뉴 건너뛰기




Volumn , Issue , 1999, Pages 192-195

Solving satisfiability in combinational circuits with backtrack search and recursive learning

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; COMPUTER AIDED SOFTWARE ENGINEERING; ELECTRONIC DESIGN AUTOMATION; FORMAL LOGIC; INTEGRATED CIRCUITS; ITERATIVE METHODS; SYSTEMS ANALYSIS; TIMING CIRCUITS;

EID: 84968426498     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SBCCI.1999.803118     Document Type: Conference Paper
Times cited : (15)

References (14)
  • 7
    • 0026623575 scopus 로고
    • Test pattern generation using boolean satisfiability
    • January
    • T. Larrabee, "Test Pattern Generation Using Boolean Satisfiability, " IEEE Trans. on Computer-Aided Design, vol. 11, no. 1, pp. 4-15, January 1992.
    • (1992) IEEE Trans. On Computer-Aided Design , vol.11 , Issue.1 , pp. 4-15
    • Larrabee, T.1
  • 10
    • 85043768066 scopus 로고    scopus 로고
    • Algorithms for satisfiability in combinational circuits based on backtrack search and recursive learning
    • June
    • J. Marques-Silva and L. Guerra e Silva, "Algorithms for Satisfiability in Combinational Circuits Based on Backtrack Search and Recursive Learning, " in Intl. Workshop on Logic Synthesis, June 1999.
    • (1999) Intl. Workshop On Logic Synthesis
    • Marques-Silva, J.1    Guerrae Silva, L.2
  • 11
    • 0027061384 scopus 로고
    • Timing analysis and delay-test generation using path recursive functions
    • November
    • P. McGeer et al., "Timing Analysis and Delay-Test Generation Using Path Recursive Functions, " in Proc. of the Intl. Conf. on Computer-Aided Design, pp. 180-183, November 1991.
    • (1991) Proc. of the Intl. Conf. On Computer-Aided Design , pp. 180-183
    • McGeer, P.1
  • 13
    • 0031341194 scopus 로고    scopus 로고
    • A SAT-based implication engine for efficient ATPG, Equivalence Checking., optimization of netlists
    • November
    • P. Tafertshofer et al., "A SAT-Based Implication Engine for Efficient ATPG, Equivalence Checking., Optimization of Netlists, " in Proc. of the Intl. Conf. on Computer-Aided Design, pp. 648-657, November 1997.
    • (1997) Proc. of the Intl. Conf. On Computer-Aided Design , pp. 648-657
    • Tafertshofer, P.1


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