메뉴 건너뛰기




Volumn 6172 LNCS, Issue , 2010, Pages 179-194

Fast LCF-style proof reconstruction for Z3

Author keywords

[No Author keywords available]

Indexed keywords

ISABELLE/HOL; OPTIMIZED IMPLEMENTATION; ORDERS OF MAGNITUDE; PERFORMANCE DATA; PROOF CHECKERS; PROOF RECONSTRUCTION; PROOF SEARCH; SATISFIABILITY MODULO THEORIES; THEOREM PROVERS;

EID: 77955251241     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14052-5_14     Document Type: Conference Paper
Times cited : (76)

References (24)
  • 1
    • 0042714866 scopus 로고    scopus 로고
    • Isabelle/HOL
    • Springer, Heidelberg
    • Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)
    • (2002) LNCS , vol.2283
    • Nipkow, T.1    Paulson, L.C.2    Wenzel, M.3
  • 5
    • 74249099067 scopus 로고    scopus 로고
    • HOL-Boogie - An Interactive Prover-Backend for the Verifying C Compiler
    • Böhme, S., Moskal, M., Schulte, W., Wolff, B.: HOL-Boogie - An Interactive Prover-Backend for the Verifying C Compiler. J. Automated Reasoning 44(1-2), 111-144 (2010)
    • (2010) J. Automated Reasoning , vol.44 , Issue.1-2 , pp. 111-144
    • Böhme, S.1    Moskal, M.2    Schulte, W.3    Wolff, B.4
  • 7
    • 45749085681 scopus 로고    scopus 로고
    • Z3: An efficient SMT solver
    • Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. Springer, Heidelberg
    • de Moura, L.M., Bjørner, N.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.4963 , pp. 337-340
    • De Moura, L.M.1    Bjørner, N.2
  • 8
    • 0011420147 scopus 로고
    • Edinburgh LCF
    • Springer, Heidelberg
    • Gordon, M., Milner, R., Wadsworth, C.P.: Edinburgh LCF. LNCS, vol. 78. Springer, Heidelberg (1979)
    • (1979) LNCS , vol.78
    • Gordon, M.1    Milner, R.2    Wadsworth, C.P.3
  • 10
    • 26444508125 scopus 로고    scopus 로고
    • Version 1.2 August retrieved January 21, 2010
    • Ranise, S., Tinelli, C.: The SMT-LIB standard: Version 1.2 (August 2006), http://combination.cs.uiowa.edu/smtlib/papers/format-v1.2-r06.08.30. pdf (retrieved January 21, 2010)
    • (2006) The SMT-LIB Standard
    • Ranise, S.1    Tinelli, C.2
  • 11
    • 30344433723 scopus 로고    scopus 로고
    • Cooperating theorem provers: A case study combining HOL-light and CVC lite
    • DOI 10.1016/j.entcs.2005.12.005, PII S1571066106000065
    • McLaughlin, S., Barrett, C., Ge, Y.: Cooperating theorem provers: A case study combining HOL-Light and CVC Lite. Electronic Notes in Theoretical Computer Science 144(2), 43-51 (2006) (Pubitemid 43061338)
    • (2006) Electronic Notes in Theoretical Computer Science , vol.144 , Issue.2 SPEC. ISS , pp. 43-51
    • McLaughlin, S.1    Barrett, C.2    Ge, Y.3
  • 13
    • 33745791973 scopus 로고    scopus 로고
    • Expressiveness + automation + soundness: Towards combining SMT solvers and interactive proof assistants
    • Hermanns, H., Palsberg, J. (eds.) TACAS 2006. Springer, Heidelberg
    • Fontaine, P., Marion, J.Y., Merz, S., Nieto, L.P., Tiu, A.: Expressiveness + automation + soundness: Towards combining SMT solvers and interactive proof assistants. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 167-181. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.3920 , pp. 167-181
    • Fontaine, P.1    Marion, J.Y.2    Merz, S.3    Nieto, L.P.4    Tiu, A.5
  • 16
    • 58549101153 scopus 로고    scopus 로고
    • Efficiently checking propositional refutations in HOL theorem provers
    • Weber, T., Amjad, H.: Efficiently checking propositional refutations in HOL theorem provers. J. Applied Logic 7(1), 26-40 (2009)
    • (2009) J. Applied Logic , vol.7 , Issue.1 , pp. 26-40
    • Weber, T.1    Amjad, H.2
  • 17
    • 30344467721 scopus 로고    scopus 로고
    • First-order proof tactics in higher-order logic theorem provers
    • Number NASA/CP-2003-212448 in NASA Technical Reports
    • Hurd, J.: First-order proof tactics in higher-order logic theorem provers. In: Design and Application of Strategies/Tactics in Higher Order Logics (STRATA '03), pp. 56-68 (2003); Number NASA/CP-2003-212448 in NASA Technical Reports
    • (2003) Design and Application of Strategies/Tactics in Higher Order Logics (STRATA '03) , pp. 56-68
    • Hurd, J.1
  • 18
    • 77955261954 scopus 로고    scopus 로고
    • retrieved January 21, 2010
    • Hurd, J.: Metis performance benchmarks, http://www.gilith.com/software/ metis/performance.html (retrieved January 21, 2010)
    • Metis Performance Benchmarks
    • Hurd, J.1
  • 19
    • 77955259160 scopus 로고    scopus 로고
    • retrieved January 21, 2010
    • HOL88 contributors: HOL88 source code, http://www.ftp.cl.cam.ac.uk/ftp/ hvg/hol88/holsys.tar.gz (retrieved January 21, 2010)
    • HOL88 Contributors: HOL88 Source Code
  • 20
    • 77955260872 scopus 로고    scopus 로고
    • 5th Annual Satisfiability Modulo Theories Competition
    • Barrett, C., Deters, M., Oliveras, A., Stump, A.: 5th Annual Satisfiability Modulo Theories Competition. In: SMT-COMP '09 (2009), http://www.smtcomp.org/2009/
    • (2009) SMT-COMP '09
    • Barrett, C.1    Deters, M.2    Oliveras, A.3    Stump, A.4
  • 21
    • 33745472695 scopus 로고    scopus 로고
    • Complete integer decision procedures as derived rules in HOL
    • Basin, D., Wolff, B. (eds.) TPHOLs 2003. Springer, Heidelberg
    • Norrish, M.: Complete integer decision procedures as derived rules in HOL. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol. 2758, pp. 71-86. Springer, Heidelberg (2003)
    • (2003) LNCS , vol.2758 , pp. 71-86
    • Norrish, M.1
  • 22
    • 33749846787 scopus 로고    scopus 로고
    • A fast linear-arithmetic solver for DPLL(T)
    • Ball, T., Jones, R.B. (eds.) CAV 2006. Springer, Heidelberg
    • Dutertre, B., de Moura, L.M.: A fast linear-arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81-94. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.4144 , pp. 81-94
    • Dutertre, B.1    De Moura, L.M.2
  • 24
    • 59249084002 scopus 로고    scopus 로고
    • Data compression for proof replay
    • Amjad, H.: Data compression for proof replay. J. Automated Reasoning 41(3-4), 193-218 (2008)
    • (2008) J. Automated Reasoning , vol.41 , Issue.3-4 , pp. 193-218
    • Amjad, H.1


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