{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T18:16:47Z","timestamp":1790878607083,"version":"4.1.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T00:00:00Z","timestamp":1247011200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s10817-009-9142-9","type":"journal-article","created":{"date-parts":[[2009,7,7]],"date-time":"2009-07-07T08:23:23Z","timestamp":1246955003000},"page":"111-144","source":"Crossref","is-referenced-by-count":15,"title":["HOL-Boogie\u2014An Interactive Prover-Backend for the Verifying C Compiler"],"prefix":"10.1007","volume":"44","author":[{"given":"Sascha","family":"B\u00f6hme","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Micha\u0142","family":"Moskal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wolfram","family":"Schulte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Burkhart","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,7,8]]},"reference":[{"issue":"2\u20134","key":"9142_CR1","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10817-009-9123-z","volume":"42","author":"E Alkassar","year":"2009","unstructured":"Alkassar, E., Hillebrand, M.A., Leinenbach, D.C., Schirmer, N.W., Starostin, A., Tsyban, A.: Balancing the load: leveraging semantics stack for systems verification. J. Autom. Reason. 42(2\u20134), 389\u2013454 (2009)","journal-title":"J. Autom. Reason."},{"key":"9142_CR2","volume-title":"High Integrity Software: The SPARK Approach to Safety and Security","author":"J Barnes","year":"2003","unstructured":"Barnes, J., Barnes, J.G.: High Integrity Software: The SPARK Approach to Safety and Security. Addison-Wesley Longman, Boston (2003)"},{"key":"9142_CR3","doi-asserted-by":"crossref","unstructured":"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.\u00a04111, pp.\u00a0364\u2013387, Springer (2006)","DOI":"10.1007\/11804192_17"},{"key":"9142_CR4","unstructured":"Barnett, M., F\u00e4hndrich, M., Leino, K.R.M., Logozzo, F., M\u00fcller, P., Schulte, W., Venter, H., Xia, S.: Spec#. Microsoft Research, Redmond. http:\/\/research.microsoft.com\/specsharp (2008)"},{"key":"9142_CR5","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1145\/1108792.1108813","volume-title":"PASTE \u201905","author":"M Barnett","year":"2005","unstructured":"Barnett, M., Leino, K.R.M.: Weakest-precondition of unstructured programs. In: PASTE \u201905, pp.\u00a082\u201387, ACM, New York (2005)"},{"key":"9142_CR6","unstructured":"Barnett, M., Leino, K.R.M., Moskal, M., R\u00fcmmer, P.: Boogie program verification. Microsoft Research, Redmond. http:\/\/research.microsoft.com\/boogie\/ (2008)"},{"key":"9142_CR7","series-title":"LNCS","first-page":"49","volume-title":"CASSIS 2004","author":"M Barnett","year":"2005","unstructured":"Barnett, M., Leino, K.R.M., Schulte, W.: The Spec# programming system: an overview. In: CASSIS 2004. LNCS, vol.\u00a03362, pp.\u00a049\u201369. Springer, New York (2005)"},{"issue":"1","key":"9142_CR8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s00165-006-0012-5","volume":"19","author":"D Basin","year":"2007","unstructured":"Basin, D., Kuruma, H., Miyazaki, K., Takaragi, K., Wolff, B.: Verifying a signature architecture: a comparative case study. Form. Asp. Comput. 19(1), 63\u201391 (2007)","journal-title":"Form. Asp. Comput."},{"issue":"4\u20135","key":"9142_CR9","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/s10009-006-0204-6","volume":"8","author":"S Beyer","year":"2006","unstructured":"Beyer, S., Jacobi, C., Kr\u00f6ning, D., Leinenbach, D., Paul, W.J.: Putting it all together: formal verification of the VAMP. Int. J. Softw. Tools Technol. 8(4\u20135), 411\u2013430 (2006)","journal-title":"Int. J. Softw. Tools Technol."},{"key":"9142_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/11576280_20","volume-title":"ICFEM","author":"S Blazy","year":"2005","unstructured":"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.\u00a03785, pp.\u00a0280\u2013299, Springer, New York (2005)"},{"key":"9142_CR11","doi-asserted-by":"crossref","unstructured":"Bobot, F., Conchon, S., Contejean, E., Lescuyer, S.: Implementing polymorphism in SMT solvers. In: Barrett, C., de Moura, L. (eds.) SMT 2008: 6th International Workshop on Satisfiability Modulo (2008)","DOI":"10.1145\/1512464.1512466"},{"key":"9142_CR12","unstructured":"B\u00f6hme, S.: HOL-Boogie. http:\/\/www4.in.tum.de\/~boehmes\/hol-boogie.xhtml (2008)"},{"key":"9142_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/978-3-540-71067-7_15","volume-title":"TPHOLs","author":"S B\u00f6hme","year":"2008","unstructured":"B\u00f6hme, S., Leino, K.R.M., Wolff, B.: HOL-Boogie\u2014an interactive prover for the Boogie program-verifier. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs. Lecture Notes in Computer Science, vol.\u00a05170, pp.\u00a0150\u2013166. Springer, New York (2008)"},{"issue":"3\u20134","key":"9142_CR14","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10817-008-9108-3","volume":"41","author":"AD Brucker","year":"2008","unstructured":"Brucker, A.D., Wolff, B.: An extensible encoding of object-oriented data models in HOL with an application to IMP+\u2009+. J. Autom. Reason. 41(3\u20134), 219\u2013249 (2008)","journal-title":"J. Autom. Reason."},{"key":"9142_CR15","volume-title":"Theorem Proving in Higher Order Logics (TPHOLs 2009). Lecture Notes in Computer Science, vol. 5674","author":"E Cohen","year":"2009","unstructured":"Cohen, E., Dahlweid, M., Hillebrand, M., Leinenbach, D., Moskal, M., Santen, T., Schulte, W., Tobies, S.: VCC: a practical system for verifying concurrent C. In: Theorem Proving in Higher Order Logics (TPHOLs 2009). Lecture Notes in Computer Science, vol. 5674. Springer, Munich Germany (2009, to appear)"},{"key":"9142_CR16","doi-asserted-by":"crossref","unstructured":"Cohen, E., Moskal, M., Schulte, W., Tobies, S.: A precise yet efficient memory model for C. In: 4th International Workshop on Systems Software Verification (SSV 2009). Electronic Notes in Theoretical Computer Science. Elsevier Science B.V. (2009, to appear)","DOI":"10.1016\/j.entcs.2009.09.061"},{"key":"9142_CR17","unstructured":"Corp., M.: Visual studio 2005 developer library. Online documentation. http:\/\/msdn.microsoft.com\/en-us\/library\/ms235402(VS.80).aspx (2005)"},{"key":"9142_CR18","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1109\/SEFM.2007.44","volume-title":"SEFM \u201907: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods","author":"D Crocker","year":"2007","unstructured":"Crocker, D., Carlton, J.: Verification of C programs using automated reasoning. In: SEFM \u201907: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods, pp.\u00a07\u201314. IEEE Computer Society, Los Alamitos (2007)"},{"key":"9142_CR19","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"CAV","author":"M Das","year":"2006","unstructured":"Das, M.: Formal specifications on industrial-strength code\u2014from myth to reality. In: Ball, T., Jones, R.B. (eds.) CAV. Lecture Notes in Computer Science, vol.\u00a04144, p. 1. Springer, New York (2006)"},{"issue":"2\u20134","key":"9142_CR20","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s10817-009-9119-8","volume":"42","author":"M Daum","year":"2009","unstructured":"Daum, M., D\u00f6rrenb\u00e4cher, J., Wolff, B.: Proving fairness and implementation correctness of a microkernel scheduler. J. Autom. Reason. 42(2\u20134), 349\u2013388 (2009)","journal-title":"J. Autom. Reason."},{"key":"9142_CR21","volume-title":"Seventh International Workshop on Automated Verification of Critical Systems (AVOCS\u201907)","author":"JE Dawson","year":"2007","unstructured":"Dawson, J.E.: Isabelle theories for machine words. In: Seventh International Workshop on Automated Verification of Critical Systems (AVOCS\u201907). Elsevier, Amsterdam (2007)"},{"key":"9142_CR22","series-title":"LNCS","first-page":"337","volume-title":"TACAS 2008","author":"L Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: TACAS 2008. LNCS, vol.\u00a04963, pp.\u00a0337\u2013340. Springer, New York (2008)"},{"key":"9142_CR23","unstructured":"DeLine, R., Leino, K.R.M.: BoogiePL: a typed procedural language for checking object-oriented programs. Tech. Rep. 2005-70, Microsoft Research (2005)"},{"issue":"3","key":"9142_CR24","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1145\/1066100.1066102","volume":"52","author":"D Detlefs","year":"2005","unstructured":"Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: A theorem prover for program checking. J. ACM 52(3), 365\u2013473 (2005)","journal-title":"J. ACM"},{"key":"9142_CR25","first-page":"3","volume-title":"Automated Formal Methods\u201908, Princeton, New Jersey, USA","author":"L Erk\u00f6k","year":"2008","unstructured":"Erk\u00f6k, L., Matthews, J.: Using Yices as an automated solver in Isabelle\/HOL. In: Automated Formal Methods\u201908, Princeton, New Jersey, USA, pp.\u00a03\u201313. ACM, New York (2008)"},{"key":"9142_CR26","unstructured":"Filli\u00e2tre, J.-C.: Why: a multi-language multi-prover verification condition generator. Tech. Rep. 1366, LRI, Universit\u00e9 Paris Sud (2003)"},{"key":"9142_CR27","series-title":"LNCS","first-page":"15","volume-title":"ICFEM 2004","author":"J-C Filli\u00e2tre","year":"2004","unstructured":"Filli\u00e2tre, J.-C., March\u00e9, C.: Multi-prover verification of C programs. In: ICFEM 2004. LNCS, vol.\u00a03308, pp.\u00a015\u201329. Springer, New York (2004)"},{"key":"9142_CR28","series-title":"LNCS","first-page":"173","volume-title":"CAV 2007","author":"J-C Filli\u00e2tre","year":"2007","unstructured":"Filli\u00e2tre, J.-C., March\u00e9, C.: The Why\/Krakatoa\/Caduceus platform for deductive program verification. In: CAV 2007. LNCS, vol.\u00a04590, pp.\u00a0173\u2013177. Springer, New York (2007)"},{"key":"9142_CR29","first-page":"234","volume-title":"PLDI 2002","author":"C Flanagan","year":"2002","unstructured":"Flanagan, C., Leino, K.R.M., Lillibridge, M., Nelson, G., Saxe, J.B., Stata, R.: Extended static checking for Java. In: PLDI 2002, pp.\u00a0234\u2013245. ACM, New York (2002)"},{"key":"9142_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/11691372_11","volume-title":"12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems\u2014TACAS\u201906, 03\/2006","author":"P Fontaine","year":"2006","unstructured":"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\u2014TACAS\u201906, 03\/2006. Lecture Notes in Computer Science, vol.\u00a03920, pp.\u00a0167\u2013181. Springer, New York (2006)"},{"key":"9142_CR31","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-3-540-27813-9_14","volume-title":"Proceedings of the 16th International Conference on Computer Aided Verification, CAV\u201904","author":"H Ganzinger","year":"2004","unstructured":"Ganzinger, H., Hagen, G., Nieuwenhuis, R., Tinelli, C.: DPLL(T): fast decision procedures. In: Proceedings of the 16th International Conference on Computer Aided Verification, CAV\u201904, pp.\u00a0175\u2013188. Springer, New York (2004)"},{"issue":"4","key":"9142_CR32","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1278901.1278904","volume":"41","author":"G Heiser","year":"2007","unstructured":"Heiser, G., Elphinstone, K., Kuz, I., Klein, G., Petters, S.M.: Towards trustworthy computing systems: taking microkernels to the next level. SIGOPS 41(4), 3\u201311 (2007)","journal-title":"SIGOPS"},{"key":"9142_CR33","unstructured":"Hurd, J.: First-order proof tactics in higher-order logic theorem provers. In: Archer, M., Vito, B.D., Mu\u00f1oz, C. (eds.) Design and Application of Strategies\/Tactics in Higher Order Logics (STRATA 2003), no. NASA\/CP-2003-212448 in NASA Technical Reports, pp.\u00a056\u201368 (2003)"},{"issue":"9","key":"9142_CR34","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.entcs.2007.04.005","volume":"174","author":"B Jacobs","year":"2007","unstructured":"Jacobs, B., Smans, J., Piessens, F., Schulte, W.: A simple sequential reasoning approach for sound modular verification of mainstream multithreaded programs. Electr. Notes Theor. Comput. Sci. 174(9), 23\u201347 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"9142_CR35","first-page":"2","volume-title":"SEFM 2005","author":"D Leinenbach","year":"2005","unstructured":"Leinenbach, D., Paul, W., Petrova, E.: Towards the formal verification of a C0 compiler: code generation and implementation correctness. In: SEFM 2005, pp.\u00a02\u201312. IEEE, Piscataway (2005)"},{"issue":"1\u20133","key":"9142_CR36","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.scico.2004.05.016","volume":"55","author":"KRM Leino","year":"2005","unstructured":"Leino, K.R.M., Millstein, T., Saxe, J.B.: Generating error traces from verification-condition counterexamples. Sci. Comput. Program. 55(1\u20133), 209\u2013226 (2005)","journal-title":"Sci. Comput. Program."},{"key":"9142_CR37","unstructured":"Leino, K.R.M., Saxe, J.B., Stata, R.: Checking Java programs via guarded commands. In: FTfJP 1999, Tech. Rep. 251, Fernuniversit\u00e4t Hagen (1999)"},{"issue":"2","key":"9142_CR38","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.entcs.2005.12.005","volume":"144","author":"S McLaughlin","year":"2006","unstructured":"McLaughlin, S., Barrett, C., Ge, Y.: Cooperating theorem provers: a case study combining HOL-light and CVC lite. Electr. Notes Theor. Comput. Sci. 144(2), 43\u201351 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"9142_CR39","unstructured":"Meng, J., Paulson, L.C.: Lightweight relevance filtering for machine-generated resolution problems. In: ESCoR: Empirically Successful Computerized Reasoning, pp.\u00a053\u201369 (2006)"},{"issue":"3","key":"9142_CR40","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1145\/44501.44503","volume":"10","author":"C Morgan","year":"1988","unstructured":"Morgan, C.: The specification statement. ACM TOPLAS 10(3), 403\u2013419 (1988)","journal-title":"ACM TOPLAS"},{"key":"9142_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/978-3-540-73595-3_27","volume-title":"CADE","author":"O M\u00fcrk","year":"2007","unstructured":"M\u00fcrk, O., Larsson, D., H\u00e4hnle, R.: KeY-C: A Tool for Verification of C Programs. In: Pfenning, F. (ed.) CADE. Lecture Notes in Computer Science, vol.\u00a04603, pp.\u00a0385\u2013390. Springer, New York (2007)"},{"issue":"4","key":"9142_CR42","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/69558.69559","volume":"11","author":"G Nelson","year":"1989","unstructured":"Nelson, G.: A generalization of Dijkstra\u2019s calculus. ACM TOPLAS 11(4), 517\u2013561 (1989)","journal-title":"ACM TOPLAS"},{"key":"9142_CR43","series-title":"LNCS","volume-title":"Isabelle\/HOL\u2014A Proof Assistant for Higher-Order Logic","author":"T Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle\/HOL\u2014A Proof Assistant for Higher-Order Logic. LNCS, vol.\u00a02283. Springer, New York (2002)"},{"key":"9142_CR44","unstructured":"Norrish, M.: C formalised in HOL. Ph.D. thesis, Computer Laboratory, University of Cambridge (1998)"},{"key":"9142_CR45","unstructured":"Paul, W., Santen, T., Tobies, S.: Verifying 50000 Lines of Code. Futures\u2014Microsoft\u2019s European Innovation Magazine, pp.\u00a042\u201343 (2008)"},{"key":"9142_CR46","unstructured":"Paul, W., von der Rhieden, T., Santen, T., Schulte, W.: The Verisoft XT Project. Universit\u00e4t des Saarlandes (2007)"},{"key":"9142_CR47","unstructured":"Ranise, S., Tinelli, C.: The SMT-LIB standard: version 1.2. Tech. rep., Dept. of Comp. Sci., The University of Iowa (2006)"},{"key":"9142_CR48","doi-asserted-by":"crossref","unstructured":"Schirmer, N.: Verification of sequential imperative programs in Isabelle\/HOL. Ph.D. thesis, Technische Universit\u00e4t M\u00fcnchen (2006)","DOI":"10.1007\/978-3-540-32275-7_26"},{"key":"9142_CR49","unstructured":"Schulte, W., Xia, S., Smans, J., Piessens, F.: A glimpse of a verifying C compiler (extended abstract). In: C\/C+\u2009+ Verification Workshop (2007)"},{"key":"9142_CR50","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/1190216.1190234","volume-title":"POPL","author":"H Tuch","year":"2007","unstructured":"Tuch, H., Klein, G., Norrish, M.: Types, bytes, and separation logic. In: Hofmann, M., Felleisen, M. (eds.) POPL, pp.\u00a097\u2013108. ACM, New York (2007)"},{"key":"9142_CR51","series-title":"LNCS","first-page":"351","volume-title":"TPHOLs 2007","author":"M Wenzel","year":"2007","unstructured":"Wenzel, M., Wolff, B.: Building formal method tools in the Isabelle\/Isar framework. In: TPHOLs 2007, LNCS, vol.\u00a04732, pp.\u00a0351\u2013366. Springer, New York (2007)"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-009-9142-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10817-009-9142-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-009-9142-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T18:49:43Z","timestamp":1739213383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10817-009-9142-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,8]]},"references-count":51,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["9142"],"URL":"https:\/\/doi.org\/10.1007\/s10817-009-9142-9","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,8]]}}}