{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:40:21Z","timestamp":1775054421470,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540297970","type":"print"},{"value":"9783540322504","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11576280_20","type":"book-chapter","created":{"date-parts":[[2005,10,24]],"date-time":"2005-10-24T10:01:26Z","timestamp":1130148086000},"page":"280-299","source":"Crossref","is-referenced-by-count":12,"title":["Formal Verification of a Memory Model for C-Like Imperative Languages"],"prefix":"10.1007","author":[{"given":"Sandrine","family":"Blazy","sequence":"first","affiliation":[]},{"given":"Xavier","family":"Leroy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"The Coq proof assistant, http:\/\/coq.inria.fr"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Appel, A.W.: Foundational proof-carrying code. In: IEEE Symp. on Logic in Computer Science (LICS), Washington, DC, USA, p. 247 (June 2001)","DOI":"10.1109\/LICS.2001.932501"},{"key":"20_CR3","series-title":"AMAST series in computing","doi-asserted-by":"publisher","DOI":"10.1142\/9789812830685","volume-title":"An algebraic approach to compiler design","author":"A. Sampaio","year":"1997","unstructured":"Sampaio, A.: An algebraic approach to compiler design. AMAST series in computing, vol.\u00a04. World Scientific, Singapore (1997)"},{"key":"20_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development Coq\u2019Art: The Calculus of Inductive Constructions","author":"Y. Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development Coq\u2019Art: The Calculus of Inductive Constructions. Springer, Heidelberg (2004)"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/10722010_8","volume-title":"5th Conf. on Mathematics of Program Construction","author":"R. Bornat","year":"2000","unstructured":"Bornat, R.: Proving pointer programs in Hoare logic. In: 5th Conf. on Mathematics of Program Construction, pp. 102\u2013126. Springer, Heidelberg (2000)"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-24725-8_27","volume-title":"Programming Languages and Systems","author":"D. Cachera","year":"2004","unstructured":"Cachera, D., Jensen, T., Pichardie, D., Rusu, V.: Extracting a Data Flow Analyser in Constructive Logic. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol.\u00a02986, pp. 385\u2013400. Springer, Heidelberg (2004)"},{"key":"20_CR7","unstructured":"Chrz\u0105szcz, J.: Modules in Type Theory with Generative Definitions. PhD thesis, Warsaw Univerity and University of Paris-Sud (January 2004)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Yu, D., Shao, Z.: Verification of safety properties for concurrent assembly code. In: Int. Conf. on Functional Programming (ICFP), Snowbird, USA, pp. 175\u2013188 (September 2004)","DOI":"10.21236\/ADA436482"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-30482-1_10","volume-title":"Formal Methods and Software Engineering","author":"J.-C. Filli\u00e2tre","year":"2004","unstructured":"Filli\u00e2tre, J.-C., March\u00e9, C.: Multi-Prover Verification of C Programs. In: Davies, J., Schulte, W., Barnett, M. (eds.) ICFEM 2004. LNCS, vol.\u00a03308, pp. 15\u201329. Springer, Heidelberg (2004)"},{"key":"20_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/3-540-48092-7_10","volume-title":"Correct System Design, Recent Insight and Advances","author":"G. Goos","year":"1999","unstructured":"Goos, G., Zimmermann, W.: Verification of compilers. In: Correct System Design, Recent Insight and Advances, London, UK, pp. 201\u2013230. Springer, Heidelberg (1999)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-540-39893-6_17","volume-title":"Formal Methods and Software Engineering","author":"G. Watson","year":"2003","unstructured":"Watson, G.: Compilation by refinement for a practical assembly language. In: Dong, J.S., Woodcock, J. (eds.) ICFEM 2003. LNCS, vol.\u00a02885, pp. 286\u2013305. Springer, Heidelberg (2003)"},{"issue":"3-4","key":"20_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1023\/B:JARS.0000021012.97318.e9","volume":"31","author":"N. Hamid","year":"2003","unstructured":"Hamid, N., Shao, Z., Trifonov, V., Monnier, S., Ni, Z.: A syntactic approach to foundational proof-carrying code. Journal of Automated Reasoning\u00a031(3-4), 191\u2013229 (2003)","journal-title":"Journal of Automated Reasoning"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Leroy, X.: Formal certification of a compiler back-end, or: programming a compiler with a proof assistant (2005) (draft, submitted for publication)","DOI":"10.1145\/1111037.1111042"},{"key":"20_CR14","unstructured":"Letouzey, P.: Programmation fonctionnelle certifi\u00e9e \u2013 L\u2019extraction de programmes dans l\u2019assistant Coq. PhD thesis, Universit\u00e9 Paris-Sud (July 2004)"},{"key":"20_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-45085-6_10","volume-title":"Automated Deduction \u2013 CADE-19","author":"F. Mehta","year":"2003","unstructured":"Mehta, F., Nipkow, T.: Proving pointer programs in higher-order logic. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol.\u00a02741, pp. 121\u2013135. Springer, Heidelberg (2003)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Mijajlovic, I., Torp-Smith, N.: Refinement in separation context. In: Second workshop on semantics, program anlysis and computing analysis for memory management (SPACE), Venice, Italy (January 2004)","DOI":"10.1007\/978-3-540-30538-5_35"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Necula, G.: Proof carrying code. In: Proc. of Principles Of Progamming Languages Conf, POPL (January 1997)","DOI":"10.1145\/263699.263712"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Necula, G.: Translation validation for an optimizing compiler. In: ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI), pp. 83\u201395 (2000)","DOI":"10.1145\/349299.349314"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BFb0054170","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Pnueli","year":"1998","unstructured":"Pnueli, A., Siegel, M., Singerman, E.: Translation validation. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol.\u00a01384, pp. 151\u2013166. Springer, Heidelberg (1998)"},{"key":"20_CR20","unstructured":"Rinard, M., Marinov, D.: Credible compilation with pointers. In: Workshop on Run-Time Result Verification (RTRV), Trento, Italy (July 1999)"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Rival, X.: Symbolic transfer function-based approaches to certified compilation. In: Principles Of Progamming Languages Conf. (POPL), pp. 1\u201313 (2004)","DOI":"10.1145\/964001.964002"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Shen, X.: Arvind, and L.\u00a0Rudolph: Commit-reconcile & fences (CRF): a new memory model for architects and compiler writers. In: ISCA 1999: 26th symposium on Computer architecture, Washington, DC, USA, pp. 150\u2013161 (1999)","DOI":"10.1145\/307338.300992"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Lerner, S., Millstein, T., Rice, E., Chambers, C.: Automated soundness proofs for dataflow analyses and transformations. In: Principles Of Progamming Languages Conf. (POPL), Long Beach, USA (2005)","DOI":"10.1145\/1040305.1040335"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Monnier, S.: Typed regions. In: workshop on semantics, program anlysis and computing analysis for memory management (SPACE), Venice, Italy (January 2004)","DOI":"10.21236\/ADA436492"},{"issue":"1\/2","key":"20_CR25","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1023\/A:1010022312623","volume":"13","author":"R.D. Tennent","year":"2000","unstructured":"Tennent, R.D., Ghica, D.R.: Abstract models of storage. Higher-Order and Symbolic Computation\u00a013(1\/2), 119\u2013129 (2000)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"20_CR26","unstructured":"Walker, D.: Stacks, heaps and regions: one logic to bind them. In: Second workshop on semantics, program anlysis and computing analysis for memory management (SPACE), Venice, Italy (January 2004) (invited talk)"},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Hu, Y., Barrett, C., Goldberg, B., Pnueli, A.: Validating more loop optimizations. In: Workshop on Compiler Optimization Meets Compiler Verification (COCV), Edinburgh, UK (2005)","DOI":"10.1016\/j.entcs.2005.02.044"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11576280_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:59:34Z","timestamp":1605625174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11576280_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297970","9783540322504"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11576280_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}