메뉴 건너뛰기




Volumn 7148 LNCS, Issue , 2012, Pages 315-331

Automating induction with an SMT solver

Author keywords

[No Author keywords available]

Indexed keywords

HIGHER-DEGREE; MECHANICAL PROOF; PROGRAM VERIFICATION; PROGRAM VERIFIERS; PROOF ASSISTANT; REWRITING STRATEGIES; SATISFIABILITY MODULO THEORIES;

EID: 84856143236     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-27940-9_21     Document Type: Conference Paper
Times cited : (59)

References (27)
  • 3
    • 35148878980 scopus 로고    scopus 로고
    • Verification of Object-Oriented Software
    • Springer, Heidelberg
    • Beckert, B., Hähnle, R., Schmitt, P.H. (eds.): Verification of Object-Oriented Software. LNCS (LNAI), vol. 4334. Springer, Heidelberg (2007)
    • (2007) LNCS (LNAI) , vol.4334
    • Beckert, B.1    Hähnle, R.2    Schmitt, P.H.3
  • 4
    • 24344470890 scopus 로고    scopus 로고
    • Interactive Theorem Proving and Program Development, Coq'Art: The Calculus of Inductive Constructions
    • Springer, Heidelberg
    • Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development, Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2004)
    • (2004) Texts in Theoretical Computer Science. An EATCS Series
    • Bertot, Y.1    Castéran, P.2
  • 5
    • 77955233329 scopus 로고    scopus 로고
    • Sledgehammer: Judgement day
    • Giesl, J., Hähnle, R. (eds.) IJCAR 2010. Springer, Heidelberg
    • Böhme, S.,Nipkow, T.: Sledgehammer: Judgement day. In: Giesl, J., Hähnle, R. (eds.) IJCAR 2010. LNCS, vol. 6173, pp. 107-121. Springer, Heidelberg (2010)
    • (2010) LNCS , vol.6173 , pp. 107-121
    • Böhme, S.1    Nipkow, T.2
  • 8
    • 79953210416 scopus 로고    scopus 로고
    • The ACL2 Sedan Theorem Proving System
    • Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. Springer, Heidelberg
    • Chamarthi, H.R., Dillinger, P.C., Manolios, P., Vroon, D.: The ACL2 Sedan Theorem Proving System. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 291-295. Springer, Heidelberg (2011)
    • (2011) LNCS , vol.6605 , pp. 291-295
    • Chamarthi, H.R.1    Dillinger, P.C.2    Manolios, P.3    Vroon, D.4
  • 9
    • 70349325391 scopus 로고    scopus 로고
    • VCC: A Practical System for Verifying Concurrent C
    • Berghofer, S., Nipkow, T., Urban, C.,Wenzel, M. (eds.) TPHOLs 2009. Springer, Heidelberg
    • Cohen, E., Dahlweid,M., Hillebrand,M.A., Leinenbach, D.,Moskal,M., Santen, T., Schulte, W., Tobies, S.: VCC: A Practical System for Verifying Concurrent C. In: Berghofer, S., Nipkow, T., Urban, C.,Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 23-42. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5674 , pp. 23-42
    • Cohen, E.1    Dahlweid, M.2    Hillebrand, M.A.3    Leinenbach, D.4    Moskal, M.5    Santen, T.6    Schulte, W.7    Tobies, S.8
  • 10
    • 45749085681 scopus 로고    scopus 로고
    • Z3: An Efficient SMT Solver
    • Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. Springer, Heidelberg
    • de Moura, L., 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.1    Bjørner, N.2
  • 11
    • 24944448541 scopus 로고    scopus 로고
    • Simplify: A theorem prover for program checking
    • Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: a theorem prover for program checking. Journal of the ACM 52(3), 365-473 (2005)
    • (2005) Journal of the ACM , vol.52 , Issue.3 , pp. 365-473
    • Detlefs, D.1    Nelson, G.2    Saxe, J.B.3
  • 12
    • 36049022245 scopus 로고    scopus 로고
    • The Why/Krakatoa/Caduceus Platform for Deductive Program Verification
    • Damm,W., Hermanns, H. (eds.) CAV 2007. Springer, Heidelberg
    • Filliâtre, J.-C., Marché, C.: The Why/Krakatoa/Caduceus Platform for Deductive Program Verification. In: Damm,W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 173-177. Springer, Heidelberg (2007)
    • (2007) LNCS , vol.4590 , pp. 173-177
    • Filliâtre, J.-C.1    Marché, C.2
  • 13
    • 79955033384 scopus 로고    scopus 로고
    • VeriFast: A Powerful, Sound, Predictable, Fast Verifier for C and Java
    • Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NFM 2011. Springer, Heidelberg
    • Jacobs, B., Smans, J., Philippaerts, P., Vogels, F., Penninckx, W., Piessens, F.: VeriFast: A Powerful, Sound, Predictable, Fast Verifier for C and Java. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NFM 2011. LNCS, vol. 6617, pp. 41-55. Springer, Heidelberg (2011)
    • (2011) LNCS , vol.6617 , pp. 41-55
    • Jacobs, B.1    Smans, J.2    Philippaerts, P.3    Vogels, F.4    Penninckx, W.5    Piessens, F.6
  • 15
    • 77955233330 scopus 로고    scopus 로고
    • Case-Analysis for Rippling and Inductive Proof
    • Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. Springer, Heidelberg
    • Johansson, M., Dixon, L., Bundy, A.: Case-Analysis for Rippling and Inductive Proof. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol. 6172, pp. 291-306. Springer, Heidelberg (2010)
    • (2010) LNCS , vol.6172 , pp. 291-306
    • Johansson, M.1    Dixon, L.2    Bundy, A.3
  • 17
    • 0008489840 scopus 로고
    • The Art of Computer Programming
    • Addison-Wesley
    • Knuth, D.E.: The Art of Computer Programming. Seminumerical Algorithms, vol. II. Addison-Wesley (1969)
    • (1969) Seminumerical Algorithms , vol.2
    • Knuth, D.E.1
  • 18
    • 77951554062 scopus 로고    scopus 로고
    • Technical report, Microsoft Research
    • Leino, K.R.M.: This is Boogie 2. Technical report, Microsoft Research (2008)
    • (2008) This Is Boogie 2
    • Leino, K.R.M.1
  • 19
    • 77957061840 scopus 로고    scopus 로고
    • Specification and verification of object-oriented software. In: Engineering Methods and Tools for Software Safety and Security
    • IOS Press Summer School Marktoberdorf 2008 lecture notes
    • Leino, K.R.M.: Specification and verification of object-oriented software. In: Engineering Methods and Tools for Software Safety and Security. NATO Science for Peace and Security Series D: Information and Communication Security, vol. 22, pp. 231-266. IOS Press (2009); Summer School Marktoberdorf 2008 lecture notes
    • (2009) NATO Science for Peace and Security Series D: Information and Communication Security , vol.22 , pp. 231-266
    • Leino, K.R.M.1
  • 20
    • 78650813780 scopus 로고    scopus 로고
    • Dafny: An Automatic Program Verifier for Functional Correctness
    • Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. Springer, Heidelberg
    • Leino, K.R.M.: Dafny: An Automatic Program Verifier for Functional Correctness. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS, vol. 6355, pp. 348-370. Springer, Heidelberg (2010)
    • (2010) LNCS , vol.6355 , pp. 348-370
    • Leino, K.R.M.1
  • 21
    • 77951610754 scopus 로고    scopus 로고
    • A Polymorphic Intermediate Verification Language: Design and Logical Encoding
    • Esparza, J., Majumdar, R. (eds.) TACAS 2010. Springer, Heidelberg
    • Leino, K.R.M., Rümmer, P.: A Polymorphic Intermediate Verification Language: Design and Logical Encoding. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 312-327. Springer, Heidelberg (2010)
    • (2010) LNCS , vol.6015 , pp. 312-327
    • Leino, K.R.M.1    Rümmer, P.2
  • 22
    • 0003642669 scopus 로고    scopus 로고
    • Checking Java programs via guarded commands
    • Technical Report 251. Fernuniversität Hagen Also available as Technical Note 1999-002, Compaq Systems Research Center
    • Leino, K.R.M., Saxe, J.B., Stata, R.: Checking Java programs via guarded commands. In: Formal Techniques for Java Programs, Technical Report 251. Fernuniversität Hagen (1999); Also available as Technical Note 1999-002, Compaq Systems Research Center
    • (1999) Formal Techniques for Java Programs
    • Leino, K.R.M.1    Saxe, J.B.2    Stata, R.3
  • 23
    • 33847102258 scopus 로고    scopus 로고
    • Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T)
    • Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). Journal of the ACM 53(6), 937-977 (2006)
    • (2006) Journal of the ACM , vol.53 , Issue.6 , pp. 937-977
    • Nieuwenhuis, R.1    Oliveras, A.2    Tinelli, C.3
  • 24
    • 84944677742 scopus 로고
    • PVS: A Prototype Verification System
    • Kapur, D. (ed.) CADE-11 1992. Springer, Heidelberg
    • Owre, S., Rushby, J.M., Shankar, N.: PVS: A Prototype Verification System. In: Kapur, D. (ed.) CADE-11 1992. LNCS (LNAI), vol. 607, pp. 748-752. Springer, Heidelberg (1992)
    • (1992) LNCS (LNAI) , vol.607 , pp. 748-752
    • Owre, S.1    Rushby, J.M.2    Shankar, N.3
  • 26
    • 7044224187 scopus 로고    scopus 로고
    • About VeriFun
    • Baader, F. (ed.) CADE-19 2003. Springer, Heidelberg
    • Walther, C., Schweitzer, S.: About VeriFun. In: Baader, F. (ed.) CADE-19 2003. LNCS (LNAI), vol. 2741, pp. 322-327. Springer, Heidelberg (2003)
    • (2003) LNCS (LNAI) , vol.2741 , pp. 322-327
    • Walther, C.1    Schweitzer, S.2
  • 27
    • 57349111788 scopus 로고    scopus 로고
    • Full functional verification of linked data structures
    • ACM
    • Zee, K., Kuncak, V., Rinard, M.: Full functional verification of linked data structures. In: PLDI 2008, pp. 349-361. ACM (2008)
    • (2008) PLDI 2008 , pp. 349-361
    • Zee, K.1    Kuncak, V.2    Rinard, M.3


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