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

Authors:
Sandrine Blazy;Xavier Leroy
Affiliations:
INRIA Rocquencourt, Le Chesnay, France;INRIA Rocquencourt, Le Chesnay, France
Venue:
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Year:
2005

Citing 14
Cited 7

Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Commit-reconcile & fences (CRF): a new memory model for architects and compiler writers

ISCA '99 Proceedings of the 26th annual international symposium on Computer architecture
Translation validation for an optimizing compiler

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Abstract Models of Storage

Higher-Order and Symbolic Computation
Verification of Compilers

Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Translation Validation

TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Proving Pointer Programs in Hoare Logic

MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Foundational Proof-Carrying Code

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Symbolic transfer function-based approaches to certified compilation

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Syntactic Approach to Foundational Proof-Carrying Code

Journal of Automated Reasoning
Interactive Theorem Proving and Program Development

Interactive Theorem Proving and Program Development
Verification of safety properties for concurrent assembly code

Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Automated soundness proofs for dataflow analyses and transformations via local rules

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Validating More Loop Optimizations

Electronic Notes in Theoretical Computer Science (ENTCS)

Formal certification of a compiler back-end or: programming a compiler with a proof assistant

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Formalisation of C Language Interfaces

Electronic Notes in Theoretical Computer Science (ENTCS)
HOL-Boogie--An Interactive Prover-Backend for the Verifying C Compiler

Journal of Automated Reasoning
Structure of a proof-producing compiler for a subset of higher order logic

ESOP'07 Proceedings of the 16th European conference on Programming
Separation logic for small-step cminor

TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Formal verification of a c compiler front-end

FM'06 Proceedings of the 14th international conference on Formal Methods
Code optimizations using formally verified properties

Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a formal verification with the Coq proof assistant of a memory model for C-like imperative languages. This model defines the memory layout and the operations that manage the memory. The model has been specified at two levels of abstraction and implemented as part of an ongoing certification in Coq of a moderately-optimising C compiler. Many properties of the memory have been verified in the specification. They facilitate the definition of precise formal semantics of C pointers. A certified OCaml code implementing the memory model has been automatically extracted from the specifications.