Separation Logic for Small-step Cminor

Details Separation Logic for Small-step Cminor Separation Logic for Small-step Cminor

2007-07-30

arxiv.org/abs/0707.4389v1

Dans 20th Int. Conference on Theorem Proving in Higher Order Logics (TPHOLs 2007) 4732 (2007) 5-21

Computer Science

Programming Languages

Version courte du rapport de recherche RR-6138

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Separation Logic for Small-step Cminor does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Separation Logic for Small-step Cminor, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Separation Logic for Small-step Cminor will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-359535