Separation Logic for Small-step Cminor

[WB07] Separation Logic for Small-step Cminor

Conférence Internationale avec comité de lecture : TPHOLs'07 Theorem Proving in Higher Order Logics, Kaiserslautern (Germany), January 2007, pp.5-21, Series LNCS 4732,

Auteurs: A. W. Appel , S. Blazy

motcle:

Résumé: 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 Sepa- ration Logic for Cminor. In this paper, we give a small-step semantics (instead of the big-step of the proved-correct compiler) that is moti- vated 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.

Download

@inproceedings {
	WB07,
	title	=	"{Separation Logic for Small-step Cminor}",
	author	=	" A. W. Appel and S. Blazy ",
	booktitle	=	"{TPHOLs'07 Theorem Proving in Higher Order Logics, Kaiserslautern (Germany)}",
	year	=	2007,
	month	=	"January",
	series	=	"LNCS 4732",
	pages	=	"5-21",
}