메뉴 건너뛰기




Volumn , Issue , 2007, Pages 85-89

Lifting propositional interpolants to the word-level

Author keywords

[No Author keywords available]

Indexed keywords

CRAIG INTERPOLANTS; EQUALITY LOGIC; INTERPOLANTS; LEVEL STRUCTURES; RESOLUTION PROOFS; TRANSITION SYSTEMS; UNSATISFIABILITY;

EID: 47249120017     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FAMCAD.2007.13     Document Type: Conference Paper
Times cited : (25)

References (10)
  • 1
    • 0001663802 scopus 로고
    • Linear reasoning. A new form of the Herbrand-Gentzen theorem
    • W. Craig, "Linear reasoning. A new form of the Herbrand-Gentzen theorem." Journal of Symbolic Logic, vol. 22, no. 3, pp. 250-268, 1957.
    • (1957) Journal of Symbolic Logic , vol.22 , Issue.3 , pp. 250-268
    • Craig, W.1
  • 3
    • 0031504901 scopus 로고    scopus 로고
    • Lower bounds for resolution and cutting plane proofs and monotone computations
    • P. Pudlák, "Lower bounds for resolution and cutting plane proofs and monotone computations," The Journal of Symbolic Logic, vol. 62, no. 3, pp. 981-998, 1997.
    • (1997) The Journal of Symbolic Logic , vol.62 , Issue.3 , pp. 981-998
    • Pudlák, P.1
  • 4
    • 27644576055 scopus 로고    scopus 로고
    • An interpolating theorem prover
    • K. L. McMillan, "An interpolating theorem prover," Theoretical Computer Science, vol. 345, no. 1, pp. 101-121, 2005.
    • (2005) Theoretical Computer Science , vol.345 , Issue.1 , pp. 101-121
    • McMillan, K.L.1
  • 5
    • 33745162025 scopus 로고    scopus 로고
    • Interpolation and SAT-based model checking
    • Computer Aided Verification CAV, Springer
    • _, "Interpolation and SAT-based model checking," in Computer Aided Verification (CAV), ser. LNCS, vol. 2725. Springer, 2003, pp. 1-13.
    • (2003) ser. LNCS , vol.2725 , pp. 1-13
    • McMillan, K.L.1
  • 7
    • 47349112898 scopus 로고    scopus 로고
    • G. Tseitin, On the complexity of proofs in poropositional logics, in Automation of Reasoning: Classical Papers in Computational Logic 1967-1970, J. Siekmann and G. Wrightson, Eds., 2. Springer, 1983, originally published 1970.
    • G. Tseitin, "On the complexity of proofs in poropositional logics," in Automation of Reasoning: Classical Papers in Computational Logic 1967-1970, J. Siekmann and G. Wrightson, Eds., vol. 2. Springer, 1983, originally published 1970.
  • 8
    • 47349088838 scopus 로고    scopus 로고
    • B. Dutertre and L. de Moura, The Yices SMT solver, Available at http://yices.csl.sri.com/tool-paper, pdf, 2006.
    • B. Dutertre and L. de Moura, "The Yices SMT solver," Available at http://yices.csl.sri.com/tool-paper, pdf, 2006.
  • 9
    • 84855198108 scopus 로고    scopus 로고
    • Building small equality graphs for deciding equality logic with uninterpreted functions
    • Y. Rodeh and O. Strichman, "Building small equality graphs for deciding equality logic with uninterpreted functions." Information and Computation, vol. 204, no. 1, pp. 26-59, 2006.
    • (2006) Information and Computation , vol.204 , Issue.1 , pp. 26-59
    • Rodeh, Y.1    Strichman, O.2
  • 10
    • 37149019057 scopus 로고    scopus 로고
    • Deciding bit-vector arithmetic with abstraction
    • Tools and Algorithms for the construction and Analysis of Systems TACAS, Springer
    • R. E. Bryant, D. Kroening, J. Ouaknine, S. A. Seshia, O. Strichman, and B. Brady, "Deciding bit-vector arithmetic with abstraction," in Tools and Algorithms for the construction and Analysis of Systems (TACAS), ser. LNCS, vol. 4424. Springer, 2007, pp. 358-372.
    • (2007) ser. LNCS , vol.4424 , pp. 358-372
    • Bryant, R.E.1    Kroening, D.2    Ouaknine, J.3    Seshia, S.A.4    Strichman, O.5    Brady, B.6


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