Formal verification of a memory model for C-like imperative languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3785 LNCS, Issue , 2005, Pages 280-299

  Blazy, Sandrine ^a   Leroy, Xavier ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER OPERATING SYSTEMS; HIGH LEVEL LANGUAGES; PROGRAM COMPILERS; SEMANTICS; SPECIFICATIONS; STORAGE ALLOCATION (COMPUTER);

FORMAL VERIFICATION; IMPERATIVE LANGUAGES; MEMORY LAYOUT; ONGOING CERTIFICATION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33646794660     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11576280_20     Document Type: Conference Paper

References (27)

1. The Coq proof assistant, http://coq.inria.fr.
2. A.W. Appel. Foundational proof-carrying code. In IEEE Symp. on Logic in Computer Science (LICS), page 247, Washington, DC, USA, June 2001.
3. A.Sampaio. An algebraic approach to compiler design, volume 4 of AMAST series in computing. World Scientific, 1997.
4. Y. Bertot and P. Castéran. Interactive Theorem Proving and Program Development Coq'Art: The Calculus of Inductive Constructions. Springer Verlag, 2004.
5. R. Bornat. Proving pointer programs in Hoare logic. In 5th Conf. on Mathematics of Program Construction, pages 102-126. Springer-Verlag, 2000.
6. D. Cachera, T. Jensen, D. Pichardie, and V. Rusu. Extracting a Data Flow Analyser in Constructive Logic. In Proc. of Europ. Symp. on Programming (ESOP'04), number 2986 in Lecture Notes in Computer Science, pages 385-400. 2004.
7. J. Chaza̧szcz. Modules in Type Theory with Generative Definitions. PhD thesis, Warsaw Univerity and University of Paris-Sud, January 2004.
8. D.Yu and Z. Shao. Verification of safety properties for concurrent assembly code. In Int. Conf. on Functional Programming (ICFP), pages 175-188, Snowbird, USA, September 2004.
9. J.-C. Filliâtre and C. Marché. Multi-Prover Verification of C Programs. In 6th Int. Conf. on Formal Engineering Methods (ICFEM), volume 3308 of Lecture Notes in Computer Science, pages 15-29, Seattle, November 2004. Springer-Verlag.
10. G. Goos and W. Zimmermann. Verification of compilers. In Correct System Design, Recent Insight and Advances, pages 201-230, London, UK, 1999. Springer-Verlag.
11. G.Watson. Compilation of refinement for a practical language. In 5th Int. Conf. on Formal Engineering Methods (ICFEM), volume 2885 of Lecture Notes in Computer Science, Singapore, November 2003. Springer-Verlag.
12. N. Hamid, Z. Shao, V. Trifonov, S. Monnier, and Z. Ni. A syntactic approach to foundational proof-carrying code. Journal of Automated Reasoning, 31(3-4):191-229, September 2003.
13. X. Leroy. Formal certification of a compiler back-end, or: programming a compiler with a proof assistant. 2005. draft, submitted for publication.
14. P. Letouzey. Programmation fonctionnelle certifiée - L'extraction de programmes dans l'assistant Coq. PhD thesis, Université Paris-Sud, July 2004.
15. F. Mehta and T. Nipkow. Proving pointer programs in higher-order logic. In Automated Deduction (CADE-19), volume 2741 of Lecture Notes in Computer Science, pages 121-135. Springer-Verlag, 2003.
16. I. Mijajlovic and N. Torp-Smith. Refinement in separation context. In Second workshop on semantics, program anlysis and computing analysis for memory management (SPACE), Venice, Italy, January 2004.
17. G. Necula. Proof carrying code. In Proc. of Principles Of Progamming Languages Conf. (POPL), January 1997.
18. G. Necula. Translation validation for an optimizing compiler. In ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI), pages 83-95, 2000.
19. A. Pnueli, M. Siegel, and E. Singerman. Translation validation. In Proc. of the 4th Int. Conf. on Tools and Algorithms for Construction and Analysis of Systems (TACAS), pages 151-166, London, UK, 1998. Springer-Verlag.
20. M. Rinard and D. Marinov. Credible compilation with pointers. In Workshop on Run-Time Result Verification (RTRV), Trento, Italy, July 1999.
21. X. Rival. Symbolic transfer function-based approaches to certified compilation. In Principles Of Progamming Languages Conf. (POPL), pages 1-13. 2004.
22. X. Shen, Arvind, and L. Rudolph. Commit-reconcile & fences (CRF): a new memory model for architects and compiler writers. In ISCA '99: 26th symposium on Computer architecture, pages 150-161, Washington, DC, USA, 1999.
23. S.Lerner, T.Millstein, E.Rice, and C.Chambers. Automated soundness proofs for dataflow analyses and transformations. In Principles Of Progamming Languages Conf. (POPL), Long Beach, USA, 2005.
24. S.Monnier. Typed regions. In workshop on semantics, program anlysis and computing analysis for memory management (SPACE), Venice, Italy, January 2004.
25. R.D. Tennent and D.R. Ghica and. Abstract models of storage. Higher-Order and Symbolic Computation, 13(1/2):119-129, 2000.
26. D. Walker. 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.
27. Y.Hu, C.Barrett, B.Goldberg, and A. Pnueli. Validating more loop optimizations. In Workshop on Compiler Optimization Meets Compiler Verification (COCV), Edinburgh, UK, 2005.