메뉴 건너뛰기




Volumn 44, Issue 1-2, 2010, Pages 111-144

HOL-boogie-an interactive prover-backend for the verifying C compiler

Author keywords

Annotation languages; Isabelle HOL; Memory models; Program verification; Theorem proving

Indexed keywords

CALCULATIONS; FORMAL LOGIC; MODELING LANGUAGES; PROGRAM DEBUGGING; THEOREM PROVING;

EID: 74249099067     PISSN: 01687433     EISSN: 15730670     Source Type: Journal    
DOI: 10.1007/s10817-009-9142-9     Document Type: Conference Paper
Times cited : (16)

References (51)
  • 3
    • 33749664425 scopus 로고    scopus 로고
    • Boogie: A modular reusable verifier for object-oriented programs
    • LNCS Springer
    • Barnett, M., Chang, B.-Y.E., DeLine, R., Jacobs, B., Leino, K.R.M.: Boogie: a modular reusable verifier for object-oriented programs. In: FMCO 2005. LNCS, vol. 4111, pp. 364-387, Springer (2006)
    • (2006) FMCO 2005 , vol.4111 , pp. 364-387
    • Barnett, M.1    Chang, B.-Y.E.2    Deline, R.3    Jacobs, B.4    Leino, M.K.R.5
  • 5
    • 84885205652 scopus 로고    scopus 로고
    • Weakest-precondition of unstructured programs
    • ACM New York. 10.1145/1108792.1108813
    • Barnett, M., Leino, K.R.M.: Weakest-precondition of unstructured programs. In: PASTE '05, pp. 82-87, ACM, New York (2005)
    • (2005) PASTE '05 , pp. 82-87
    • Barnett, M.1    Leino, K.R.M.2
  • 7
    • 19044390891 scopus 로고    scopus 로고
    • The Spec# programming system: An overview
    • Springer New York
    • Barnett, M., Leino, K.R.M., Schulte, W.: The Spec# programming system: an overview. In: CASSIS 2004. LNCS, vol. 3362, pp. 49-69. Springer, New York (2005)
    • (2005) CASSIS 2004 LNCS 3362 , pp. 49-69
    • Barnett, M.1    Leino, K.R.M.2    Schulte, W.3
  • 8
    • 33947138592 scopus 로고    scopus 로고
    • Verifying a signature architecture: A comparative case study
    • DOI 10.1007/s00165-006-0012-5
    • D Basin H Kuruma K Miyazaki K Takaragi B Wolff 2007 Verifying a signature architecture: a comparative case study Form. Asp. Comput. 19 1 63 91 1111.68075 10.1007/s00165-006-0012-5 (Pubitemid 46407479)
    • (2007) Formal Aspects of Computing , vol.19 , Issue.1 , pp. 63-91
    • Basin, D.1    Kuruma, H.2    Miyazaki, K.3    Takaragi, K.4    Wolff, B.5
  • 10
    • 33646794660 scopus 로고    scopus 로고
    • Formal verification of a memory model for C-like imperative languages
    • K-K Lau R. Banach (eds). Springer New York
    • Blazy, S., Leroy, X.: Formal verification of a memory model for C-like imperative languages. In: Lau, K.-K., Banach, R. (eds.) ICFEM. Lecture Notes in Computer Science, vol. 3785, pp. 280-299, Springer, New York (2005)
    • (2005) ICFEM Lecture Notes in Computer Science 3785 , pp. 280-299
    • Blazy, S.1    Leroy, X.2
  • 12
    • 74249123661 scopus 로고    scopus 로고
    • Böhme, S.: HOL-Boogie
    • Böhme, S.: HOL-Boogie. http://www4.in.tum.de/~boehmes/hol-boogie. xhtml (2008)
    • (2008)
  • 13
    • 57049083557 scopus 로고    scopus 로고
    • HOL-Boogie-an interactive prover for the Boogie program-verifier
    • O.A. Mohamed C. Muñoz S. Tahar (eds). Springer New York
    • Böhme, S., Leino, K.R.M., Wolff, B.: HOL-Boogie-an interactive prover for the Boogie program-verifier. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) TPHOLs. Lecture Notes in Computer Science, vol. 5170, pp. 150-166. Springer, New York (2008)
    • (2008) TPHOLs Lecture Notes in Computer Science 5170 , pp. 150-166
    • Böhme, S.1    Leino, K.R.M.2    Wolff, B.3
  • 14
    • 59249104834 scopus 로고    scopus 로고
    • An extensible encoding of object-oriented data models in HOL with an application to IMP+∈+
    • 05638510 10.1007/s10817-008-9108-3
    • AD Brucker B Wolff 2008 An extensible encoding of object-oriented data models in HOL with an application to IMP+∈+ J. Autom. Reason. 41 3-4 219 249 05638510 10.1007/s10817-008-9108-3
    • (2008) J. Autom. Reason. , vol.41 , Issue.34 , pp. 219-249
    • Brucker, A.D.1    Wolff, B.2
  • 17
    • 74249108531 scopus 로고    scopus 로고
    • Corp., M.: Visual studio 2005 developer library. Online documentation
    • Corp., M.: Visual studio 2005 developer library. Online documentation. http://msdn.microsoft.com/en-us/library/ms235402(VS.80).aspx (2005)
    • (2005)
  • 19
    • 33749836630 scopus 로고    scopus 로고
    • Formal specifications on industrial-strength code-from myth to reality
    • T. Ball R.B. Jones (eds). Springer New York
    • Das, M.: Formal specifications on industrial-strength code-from myth to reality. In: Ball, T., Jones, R.B. (eds.) CAV. Lecture Notes in Computer Science, vol. 4144, p. 1. Springer, New York (2006)
    • (2006) CAV Lecture Notes in Computer Science 4144 , pp. 1
    • Das, M.1
  • 20
    • 67349187952 scopus 로고    scopus 로고
    • Proving fairness and implementation correctness of a microkernel scheduler
    • 05600118 10.1007/s10817-009-9119-8
    • M Daum J Dörrenbächer B Wolff 2009 Proving fairness and implementation correctness of a microkernel scheduler J. Autom. Reason. 42 2-4 349 388 05600118 10.1007/s10817-009-9119-8
    • (2009) J. Autom. Reason. , vol.42 , Issue.24 , pp. 349-388
    • Daum, M.1    Dörrenbächer, J.2    Wolff, B.3
  • 22
    • 45749085681 scopus 로고    scopus 로고
    • Z3: An efficient SMT solver
    • Springer New York
    • de Moura, L., Bjørner, N.: Z3: an efficient SMT solver. In: TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, New York (2008)
    • (2008) TACAS 2008 LNCS 4963 , pp. 337-340
    • De Moura, L.1    Bjørner, N.2
  • 23
    • 34250195633 scopus 로고    scopus 로고
    • BoogiePL: A typed procedural language for checking object-oriented programs
    • Microsoft Research
    • DeLine, R., Leino, K.R.M.: BoogiePL: a typed procedural language for checking object-oriented programs. Tech. Rep. 2005-70, Microsoft Research (2005)
    • (2005) Tech. Rep. 2005-70
    • Deline, R.1    Leino, K.R.M.2
  • 24
    • 24944448541 scopus 로고    scopus 로고
    • Simplify: A theorem prover for program checking
    • DOI 10.1145/1066100.1066102
    • D Detlefs G Nelson JB Saxe 2005 Simplify: A theorem prover for program checking J. ACM 52 3 365 473 10.1145/1066100.1066102 2146512 (Pubitemid 43078377)
    • (2005) Journal of the ACM , vol.52 , Issue.3 , pp. 365-473
    • Detlefs, D.1    Nelson, G.2    Saxe, J.B.3
  • 26
    • 24244437523 scopus 로고    scopus 로고
    • Why: A multi-language multi-prover verification condition generator
    • LRI, Université Paris Sud
    • Filliâtre, J.-C.: Why: a multi-language multi-prover verification condition generator. Tech. Rep. 1366, LRI, Université Paris Sud (2003)
    • (2003) Tech. Rep. 1366
    • Filliâtre, J.-C.1
  • 27
    • 35048862900 scopus 로고    scopus 로고
    • Multi-prover verification of C programs
    • Springer New York
    • Filliâtre, J.-C., Marché, C.: Multi-prover verification of C programs. In: ICFEM 2004. LNCS, vol. 3308, pp. 15-29. Springer, New York (2004)
    • (2004) ICFEM 2004 LNCS 3308 , pp. 15-29
    • Filliâtre, J.-C.1    Marché, C.2
  • 28
    • 36049022245 scopus 로고    scopus 로고
    • The Why/Krakatoa/Caduceus platform for deductive program verification
    • Springer New York
    • Filliâtre, J.-C., Marché, C.: The Why/Krakatoa/Caduceus platform for deductive program verification. In: CAV 2007. LNCS, vol. 4590, pp. 173-177. Springer, New York (2007)
    • (2007) CAV 2007 LNCS 4590 , pp. 173-177
    • Filliâtre, J.-C.1    Marché, C.2
  • 30
    • 33745791973 scopus 로고    scopus 로고
    • Expressiveness + automation + soundness: Towards combining SMT solvers and interactive proof assistants
    • DOI 10.1007/11691372-11, Tools and Algorithms for the Construction and Analysis of Systems - 12th International Conference, TACAS 2006. Held as Part of the Joint European Conf. on Theory and Practice of Software, ETAPS 2006
    • Fontaine, P., Marion, J.-Y., Merz, S., Prensa Nieto, L., Tiu, A.: Expressiveness + automation + soundness: towards combining SMT solvers and interactive proof assistants. In: Hermanns, H., Palsberg, J. (eds.) 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems-TACAS'06, 03/2006. Lecture Notes in Computer Science, vol. 3920, pp. 167-181. Springer, New York (2006) (Pubitemid 44019369)
    • (2006) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , pp. 167-181
    • Fontaine, P.1    Marion, J.-Y.2    Merz, S.3    Nieto, L.P.4    Tiu, A.5
  • 32
    • 77952256837 scopus 로고    scopus 로고
    • Towards trustworthy computing systems: Taking microkernels to the next level
    • 10.1145/1278901.1278904
    • G Heiser K Elphinstone I Kuz G Klein SM Petters 2007 Towards trustworthy computing systems: taking microkernels to the next level SIGOPS 41 4 3 11 10.1145/1278901.1278904
    • (2007) SIGOPS , vol.41 , Issue.4 , pp. 3-11
    • Heiser, G.1    Elphinstone, K.2    Kuz, I.3    Klein, G.4    Petters, S.M.5
  • 34
    • 34249997341 scopus 로고    scopus 로고
    • A simple sequential reasoning approach for sound modular verification of mainstream multithreaded programs
    • DOI 10.1016/j.entcs.2007.04.005, PII S157106610700357X, Proceedings of the Thread Verification Workshop (TV 2006)
    • B Jacobs J Smans F Piessens W Schulte 2007 A simple sequential reasoning approach for sound modular verification of mainstream multithreaded programs Electr. Notes Theor. Comput. Sci. 174 9 23 47 10.1016/j.entcs.2007.04.005 (Pubitemid 46891376)
    • (2007) Electronic Notes in Theoretical Computer Science , vol.174 , Issue.9 , pp. 23-47
    • Jacobs, B.1    Smans, J.2    Piessens, F.3    Schulte, W.4
  • 35
    • 84883305871 scopus 로고    scopus 로고
    • Towards the formal verification of a C0 compiler: Code generation and implementation correctness
    • IEEE Piscataway
    • Leinenbach, D., Paul, W., Petrova, E.: Towards the formal verification of a C0 compiler: code generation and implementation correctness. In: SEFM 2005, pp. 2-12. IEEE, Piscataway (2005)
    • (2005) SEFM 2005 , pp. 2-12
    • Leinenbach, D.1    Paul, W.2    Petrova, E.3
  • 36
    • 13144267779 scopus 로고    scopus 로고
    • Generating error traces from verification-condition counterexamples
    • DOI 10.1016/j.scico.2004.05.016, PII S0167642304001510
    • KRM Leino T Millstein JB Saxe 2005 Generating error traces from verification-condition counterexamples Sci. Comput. Program. 55 1-3 209 226 1075.68018 10.1016/j.scico.2004.05.016 2135894 (Pubitemid 40178265)
    • (2005) Science of Computer Programming , vol.55 , pp. 209-226
    • Leino, K.R.M.1    Millstein, T.2    Saxe, J.B.3
  • 37
    • 0003642669 scopus 로고    scopus 로고
    • Checking Java programs via guarded commands
    • FTfJP 1999 Fernuniversität Hagen
    • Leino, K.R.M., Saxe, J.B., Stata, R.: Checking Java programs via guarded commands. In: FTfJP 1999, Tech. Rep. 251, Fernuniversität Hagen (1999)
    • (1999) Tech. Rep. 251
    • Leino, M.K.R.1    Saxe, B.J.2    Stata, R.3
  • 38
    • 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
    • S McLaughlin C Barrett Y Ge 2006 Cooperating theorem provers: a case study combining HOL-light and CVC lite Electr. Notes Theor. Comput. Sci. 144 2 43 51 10.1016/j.entcs.2005.12.005 (Pubitemid 43061338)
    • (2006) Electronic Notes in Theoretical Computer Science , vol.144 , pp. 43-51
    • McLaughlin, S.1    Barrett, C.2    Ge, Y.3
  • 39
    • 74249103629 scopus 로고    scopus 로고
    • Lightweight relevance filtering for machine-generated resolution problems
    • ESCoR
    • Meng, J., Paulson, L.C.: Lightweight relevance filtering for machine-generated resolution problems. In: ESCoR: Empirically Successful Computerized Reasoning, pp. 53-69 (2006)
    • (2006) Empirically Successful Computerized Reasoning , pp. 53-69
    • Meng, J.1    Paulson, C.L.2
  • 40
    • 0024036510 scopus 로고
    • The specification statement
    • 0825.68302 10.1145/44501.44503
    • C Morgan 1988 The specification statement ACM TOPLAS 10 3 403 419 0825.68302 10.1145/44501.44503
    • (1988) ACM TOPLAS , vol.10 , Issue.3 , pp. 403-419
    • Morgan, C.1
  • 41
    • 35148835701 scopus 로고    scopus 로고
    • KeY-C: A tool for verification of C programs
    • F. Pfenning (eds). Springer New York
    • Mürk, O., Larsson, D., Hähnle, R.: KeY-C: A Tool for Verification of C Programs. In: Pfenning, F. (ed.) CADE. Lecture Notes in Computer Science, vol. 4603, pp. 385-390. Springer, New York (2007)
    • (2007) CADE Lecture Notes in Computer Science 4603 , pp. 385-390
    • Mürk, O.1    Larsson, D.2    Hähnle, R.3
  • 44
    • 0003613448 scopus 로고    scopus 로고
    • Ph.D. thesis, Computer Laboratory, University of Cambridge
    • Norrish, M.: C formalised in HOL. Ph.D. thesis, Computer Laboratory, University of Cambridge (1998)
    • (1998) C Formalised in HOL
    • Norrish, M.1
  • 47
    • 26444508125 scopus 로고    scopus 로고
    • The SMT-LIB standard
    • version 1.2 Dept. of Comp. Sci., The University of Iowa
    • Ranise, S., Tinelli, C.: The SMT-LIB standard: version 1.2. Tech. rep., Dept. of Comp. Sci., The University of Iowa (2006)
    • (2006) Tech. Rep.
    • Ranise, S.1    Tinelli, C.2
  • 51
    • 38049033307 scopus 로고    scopus 로고
    • Building formal method tools in the Isabelle/Isar framework
    • Springer New York
    • Wenzel, M., Wolff, B.: Building formal method tools in the Isabelle/Isar framework. In: TPHOLs 2007, LNCS, vol. 4732, pp. 351-366. Springer, New York (2007)
    • (2007) TPHOLs 2007 LNCS 4732 , pp. 351-366
    • Wenzel, M.1    Wolff, B.2


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