Separation Logic for Small-step Cminor - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Separation Logic for Small-step Cminor


Cminor is a mid-level imperative programming language; there are proved-correct optimizing compilers from C to Cminor and from Cminor to machine language. We have redesigned Cminor so that it is suitable for Hoare Logic reasoning and we have designed a Separation Logic for Cminor. In this paper, we give a small-step semantics (instead of the big-step of the proved-correct compiler) that is motivated by the need to support future concurrent extensions. We detail a machine-checked proof of soundness of our Separation Logic. This is the first large-scale machine-checked proof of a Separation Logic w.r.t. a small-step semantics. The work presented in this paper has been carried out in the Coq proof assistant. It is a first step towards an environment in which concurrent Cminor programs can be verified using Separation Logic and also compiled by a proved-correct compiler with formal end-to-end correctness guarantees.
Fichier principal
Vignette du fichier
paperTPHOL.pdf (241.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00165915 , version 1 (30-07-2007)


  • HAL Id : inria-00165915 , version 1
  • ARXIV : 0707.4389


Andrew W. W. Appel, Sandrine Blazy. Separation Logic for Small-step Cminor. 20th Int. Conference on Theorem Proving in Higher Order Logics (TPHOLs 2007), Sep 2007, Kaiserslautern, Germany. pp.5-21. ⟨inria-00165915⟩
154 View
191 Download



Gmail Facebook X LinkedIn More