coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Richard Ford <richardlford AT gmail.com>
- To: Kevin Sullivan <sullivan.kevinj AT gmail.com>, "coq-club AT inria.fr" <coq-club AT inria.fr>
- Subject: RE: [Coq-Club] Program Logics for Certified Compilers
- Date: Wed, 30 Apr 2014 11:55:05 -0700
UPS delivered my copy this morning. I'm enjoying it already. Thank for writing this!
Sent from my Windows Phone
Sent from my Windows Phone
From: Kevin Sullivan
Sent: 4/30/2014 10:41
To: coq-club AT inria.fr
Subject: Re: [Coq-Club] Program Logics for Certified Compilers
Congrats! I look forward to reading it. --Kevin Sullivan
On Wed, Apr 30, 2014 at 9:29 AM, Andrew W. Appel <appel AT cs.princeton.edu> wrote:
I am happy to announce publication of
Program Logics for Certified Compilers
by Andrew W. Appel
with Robert Dockins, Aquinas Hobor, Lennart Beringer, Josiah Dodds,
Gordon Stewart, Sandrine Blazy, and Xavier Leroy
Cambridge University Press, 2014 (469 pages).
The book covers separation logic and its application
to a Verified Software Toolchain with all components
proved correct in Coq, of course.
E-book 15 dollars cheap! or Hardcover
At the same time there is release 1.3 (open source)
of the Verified Software Toolchain, in particular the
Verifiable C program logic and its proof (semi)automation
tools for interactively verifying C programs in Coq.
Book description:
Separation logic is the twenty-first-century variant of Hoare logic that permits verification of pointer-manipulating programs. This book covers practical and theoretical aspects of separation logic at a level accessible to beginning graduate students interested in software verification. On the practical side it offers an introduction to verification in Hoare and separation logics, simple case studies for toy languages, and the Verifiable C program logic for the C programming language. On the theoretical side it presents separation algebras as models of separation logics; step-indexed models of higher-order logical features for higher-order programs; indirection theory for constructing step-indexed separation algebras; tree-shares as models for shared ownership; and the semantic construction (and soundness proof) of Verifiable C. In addition, the book covers several aspects of the CompCert verified C compiler, and its connection to foundationally verified software analysis tools. All constructions and proofs are made rigorous and accessible in the Coq developments of the open-source Verified Software Toolchain.
- [Coq-Club] Program Logics for Certified Compilers, Andrew W. Appel, 04/30/2014
- Re: [Coq-Club] Program Logics for Certified Compilers, Kevin Sullivan, 04/30/2014
- <Possible follow-up(s)>
- RE: [Coq-Club] Program Logics for Certified Compilers, Richard Ford, 04/30/2014
- Re: [Coq-Club] Program Logics for Certified Compilers, Timothy Carstens, 04/30/2014
Archive powered by MHonArc 2.6.18.