메뉴 건너뛰기




Volumn , Issue , 2005, Pages 451-456

Structural search for RTL with predicate learning

Author keywords

Interval Arithmetic; Learning; Predicate Abstraction; Satisfiability

Indexed keywords

ALGORITHMS; AUTOMATIC TESTING; BENCHMARKING; BOOLEAN ALGEBRA; CONSTRAINT THEORY; DIGITAL ARITHMETIC; FORMAL LOGIC; LEARNING SYSTEMS; NETWORKS (CIRCUITS);

EID: 27944450082     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/dac.2005.193851     Document Type: Conference Paper
Times cited : (8)

References (17)
  • 3
    • 49549162745 scopus 로고
    • Fourier-Motzkin elimination and its dual
    • G. Dantzig and B. Eaves. Fourier-Motzkin Elimination and its Dual. Journal of Combinatorial Theory, A(14):288-297, 1973.
    • (1973) Journal of Combinatorial Theory , vol.A , Issue.14 , pp. 288-297
    • Dantzig, G.1    Eaves, B.2
  • 4
    • 84919401135 scopus 로고
    • A machine program for theorem proving
    • M. Davis, G. Logemann, and D. Loveland. A Machine Program for Theorem Proving. Comm. of the ACM, 5(7):394-297, 1962.
    • (1962) Comm. of the ACM , vol.5 , Issue.7 , pp. 394-1297
    • Davis, M.1    Logemann, G.2    Loveland, D.3
  • 6
    • 0035271698 scopus 로고    scopus 로고
    • Automatic test pattern generation for functional register-transfer level circuits using assignment decision diagrams
    • march
    • I. Ghosh and M. Fujita. Automatic Test Pattern Generation for Functional Register-Transfer Level Circuits using Assignment Decision Diagrams. IEEE Transactions on CAD., 20(3):402-415, march 2001.
    • (2001) IEEE Transactions on CAD , vol.20 , Issue.3 , pp. 402-415
    • Ghosh, I.1    Fujita, M.2
  • 8
    • 0000820904 scopus 로고    scopus 로고
    • Interval arithmetic: Principles to implementation
    • T. Hickey, Q. Ju, and M. H. V. Emden. Interval Arithmetic: Principles to Implementation Journal of the ACM, 48(5):1038-1068, 2001.
    • (2001) Journal of the ACM , vol.48 , Issue.5 , pp. 1038-1068
    • Hickey, T.1    Ju, Q.2    Emden, M.H.V.3
  • 9
    • 26444463842 scopus 로고    scopus 로고
    • Efficient conflict based learning in a constraint solver for RTL circuits
    • Mar
    • M. K. Iyer, G. Parthasarathy, and K.-T. Cheng. Efficient Conflict Based Learning in a Constraint Solver for RTL Circuits, in Proceedings of DATE'2004), pages 666-671, Mar 2005.
    • (2005) Proceedings of DATE'2004 , pp. 666-671
    • Iyer, M.K.1    Parthasarathy, G.2    Cheng, K.-T.3
  • 10
    • 0028501364 scopus 로고
    • Recursive learning: A new implication technique for efficient solutions to CAD problems
    • Sept.
    • W. Kunz and D. Pradhan. Recursive Learning: A New Implication Technique for Efficient Solutions to CAD Problems. IEEE Trans. on CAD, 13:1143-1158, Sept. 1994.
    • (1994) IEEE Trans. on CAD , vol.13 , pp. 1143-1158
    • Kunz, W.1    Pradhan, D.2
  • 11
    • 0032680865 scopus 로고    scopus 로고
    • GRASP - A search algorithm for propositional satisfiability
    • J.P Marques-Silva and K.A. Sakallah. GRASP - A Search Algorithm for Propositional Satisfiability. IEEE Trans. on Computers, 48(5):506-521, 1999.
    • (1999) IEEE Trans. on Computers , vol.48 , Issue.5 , pp. 506-521
    • Marques-Silva, J.P.1    Sakallah, K.A.2
  • 12
    • 27944433536 scopus 로고    scopus 로고
    • An efficient finite-domain constraint solver for RTL circuits
    • June
    • G. Parthasarathy, M.K. Iyer, K.-T. Cheng, and Li.C. Wang. An Efficient Finite-domain Constraint Solver for RTL Circuits. In 41st DAC, June 2004.
    • (2004) 41st DAC
    • Parthasarathy, G.1    Iyer, M.K.2    Cheng, K.-T.3    Wang, L.C.4
  • 13
    • 0004327240 scopus 로고    scopus 로고
    • The omega calculator and library v1.1.0
    • Dept. of CS, UMCP, November
    • W. Kelly, et al., The Omega Calculator and Library v1.1.0. Technical report, Dept. of CS, UMCP, November 1996.
    • (1996) Technical Report
    • Kelly, W.1
  • 15
    • 0042134797 scopus 로고    scopus 로고
    • A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
    • June
    • S. Seshia, S. Lahiri, and R. Bryant. A Hybrid SAT-based Decision Procedure for Separation Logic with Uninterpreted Functions. In 40th DAC, pages 425-430, June 2003.
    • (2003) 40th DAC , pp. 425-430
    • Seshia, S.1    Lahiri, S.2    Bryant, R.3


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