@inproceedings{2818cebf3aa443c3988f118ce5f2850b,

title = "Separation logic for small-step Cminor",

abstract = "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.",

author = "Appel, {Andrew W.} and Sandrine Blazy",

year = "2007",

doi = "10.1007/978-3-540-74591-4_3",

language = "English (US)",

isbn = "9783540745907",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "5--21",

booktitle = "Theorem Proving in Higher Order Logics - 20th International Conference, TPHOLs 2007, Proceedings",

address = "Germany",

note = "20th International Conference on Theorem Proving in Higher-Order Logics, TPHOLs 2007 ; Conference date: 10-09-2007 Through 13-09-2007",

}