Program logics for certified compilers:
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 prac...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Cambridge
Cambridge University Press
2014
|
Schlagworte: | |
Online-Zugang: | BSB01 FHN01 UER01 URL des Erstveröffentlichers |
Zusammenfassung: | 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 |
Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
Beschreibung: | 1 online resource (x, 458 pages) |
ISBN: | 9781107256552 |
DOI: | 10.1017/CBO9781107256552 |
Internformat
MARC
LEADER | 00000nmm a2200000zc 4500 | ||
---|---|---|---|
001 | BV043943878 | ||
003 | DE-604 | ||
005 | 20200630 | ||
007 | cr|uuu---uuuuu | ||
008 | 161206s2014 |||| o||u| ||||||eng d | ||
020 | |a 9781107256552 |c Online |9 978-1-107-25655-2 | ||
024 | 7 | |a 10.1017/CBO9781107256552 |2 doi | |
035 | |a (ZDB-20-CBO)CR9781107256552 | ||
035 | |a (OCoLC)992886088 | ||
035 | |a (DE-599)BVBBV043943878 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-12 |a DE-29 |a DE-92 | ||
082 | 0 | |a 005.1/4 |2 23 | |
100 | 1 | |a Appel, Andrew W. |d 1960- |e Verfasser |0 (DE-588)1011297485 |4 aut | |
245 | 1 | 0 | |a Program logics for certified compilers |c Andrew W. Appel [and seven others] |
264 | 1 | |a Cambridge |b Cambridge University Press |c 2014 | |
300 | |a 1 online resource (x, 458 pages) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
505 | 8 | |a Generic separation logic -- Hoare logic -- Separation logic -- Soundness of Hoare logic -- Mechanized semantic library -- Separation algebras -- Operators on separation algebras -- First-order separation logic -- A little case study -- Covariant recursive predicates -- Share accounting -- Higher order separation logic -- Separation logic as a logic -- From separation algebras to separation logic -- Simplification by rewriting -- Introduction to step-indexing -- Predicate implication and subtyping -- General recursive predicates -- Case study: separation logic with first-class functions | |
520 | |a 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 | ||
650 | 4 | |a Computer software / Verification | |
650 | 4 | |a Logic, Symbolic and mathematical | |
650 | 4 | |a Compilers (Computer programs) | |
650 | 0 | 7 | |a Compiler |0 (DE-588)4148248-7 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Programmverifikation |0 (DE-588)4135576-3 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Programmverifikation |0 (DE-588)4135576-3 |D s |
689 | 0 | 1 | |a Compiler |0 (DE-588)4148248-7 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-1-107-04801-0 |
856 | 4 | 0 | |u https://doi.org/10.1017/CBO9781107256552 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-20-CBO | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-029352849 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
966 | e | |u https://doi.org/10.1017/CBO9781107256552 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1017/CBO9781107256552 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1017/CBO9781107256552 |l UER01 |p ZDB-20-CBO |q UER_PDA_CBO_Kauf |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804176888185225216 |
---|---|
any_adam_object | |
author | Appel, Andrew W. 1960- |
author_GND | (DE-588)1011297485 |
author_facet | Appel, Andrew W. 1960- |
author_role | aut |
author_sort | Appel, Andrew W. 1960- |
author_variant | a w a aw awa |
building | Verbundindex |
bvnumber | BV043943878 |
collection | ZDB-20-CBO |
contents | Generic separation logic -- Hoare logic -- Separation logic -- Soundness of Hoare logic -- Mechanized semantic library -- Separation algebras -- Operators on separation algebras -- First-order separation logic -- A little case study -- Covariant recursive predicates -- Share accounting -- Higher order separation logic -- Separation logic as a logic -- From separation algebras to separation logic -- Simplification by rewriting -- Introduction to step-indexing -- Predicate implication and subtyping -- General recursive predicates -- Case study: separation logic with first-class functions |
ctrlnum | (ZDB-20-CBO)CR9781107256552 (OCoLC)992886088 (DE-599)BVBBV043943878 |
dewey-full | 005.1/4 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 005 - Computer programming, programs, data, security |
dewey-raw | 005.1/4 |
dewey-search | 005.1/4 |
dewey-sort | 15.1 14 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
doi_str_mv | 10.1017/CBO9781107256552 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03792nmm a2200505zc 4500</leader><controlfield tag="001">BV043943878</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200630 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2014 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107256552</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-107-25655-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9781107256552</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781107256552</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)992886088</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043943878</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1/4</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Appel, Andrew W.</subfield><subfield code="d">1960-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1011297485</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Program logics for certified compilers</subfield><subfield code="c">Andrew W. Appel [and seven others]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (x, 458 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Generic separation logic -- Hoare logic -- Separation logic -- Soundness of Hoare logic -- Mechanized semantic library -- Separation algebras -- Operators on separation algebras -- First-order separation logic -- A little case study -- Covariant recursive predicates -- Share accounting -- Higher order separation logic -- Separation logic as a logic -- From separation algebras to separation logic -- Simplification by rewriting -- Introduction to step-indexing -- Predicate implication and subtyping -- General recursive predicates -- Case study: separation logic with first-class functions</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software / Verification</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Compilers (Computer programs)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Compiler</subfield><subfield code="0">(DE-588)4148248-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmverifikation</subfield><subfield code="0">(DE-588)4135576-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Programmverifikation</subfield><subfield code="0">(DE-588)4135576-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Compiler</subfield><subfield code="0">(DE-588)4148248-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-1-107-04801-0</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9781107256552</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029352849</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781107256552</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781107256552</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781107256552</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">UER_PDA_CBO_Kauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV043943878 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T07:39:20Z |
institution | BVB |
isbn | 9781107256552 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029352849 |
oclc_num | 992886088 |
open_access_boolean | |
owner | DE-12 DE-29 DE-92 |
owner_facet | DE-12 DE-29 DE-92 |
physical | 1 online resource (x, 458 pages) |
psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO ZDB-20-CBO UER_PDA_CBO_Kauf |
publishDate | 2014 |
publishDateSearch | 2014 |
publishDateSort | 2014 |
publisher | Cambridge University Press |
record_format | marc |
spelling | Appel, Andrew W. 1960- Verfasser (DE-588)1011297485 aut Program logics for certified compilers Andrew W. Appel [and seven others] Cambridge Cambridge University Press 2014 1 online resource (x, 458 pages) txt rdacontent c rdamedia cr rdacarrier Title from publisher's bibliographic system (viewed on 05 Oct 2015) Generic separation logic -- Hoare logic -- Separation logic -- Soundness of Hoare logic -- Mechanized semantic library -- Separation algebras -- Operators on separation algebras -- First-order separation logic -- A little case study -- Covariant recursive predicates -- Share accounting -- Higher order separation logic -- Separation logic as a logic -- From separation algebras to separation logic -- Simplification by rewriting -- Introduction to step-indexing -- Predicate implication and subtyping -- General recursive predicates -- Case study: separation logic with first-class functions 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 Computer software / Verification Logic, Symbolic and mathematical Compilers (Computer programs) Compiler (DE-588)4148248-7 gnd rswk-swf Programmverifikation (DE-588)4135576-3 gnd rswk-swf Programmverifikation (DE-588)4135576-3 s Compiler (DE-588)4148248-7 s 1\p DE-604 Erscheint auch als Druckausgabe 978-1-107-04801-0 https://doi.org/10.1017/CBO9781107256552 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Appel, Andrew W. 1960- Program logics for certified compilers Generic separation logic -- Hoare logic -- Separation logic -- Soundness of Hoare logic -- Mechanized semantic library -- Separation algebras -- Operators on separation algebras -- First-order separation logic -- A little case study -- Covariant recursive predicates -- Share accounting -- Higher order separation logic -- Separation logic as a logic -- From separation algebras to separation logic -- Simplification by rewriting -- Introduction to step-indexing -- Predicate implication and subtyping -- General recursive predicates -- Case study: separation logic with first-class functions Computer software / Verification Logic, Symbolic and mathematical Compilers (Computer programs) Compiler (DE-588)4148248-7 gnd Programmverifikation (DE-588)4135576-3 gnd |
subject_GND | (DE-588)4148248-7 (DE-588)4135576-3 |
title | Program logics for certified compilers |
title_auth | Program logics for certified compilers |
title_exact_search | Program logics for certified compilers |
title_full | Program logics for certified compilers Andrew W. Appel [and seven others] |
title_fullStr | Program logics for certified compilers Andrew W. Appel [and seven others] |
title_full_unstemmed | Program logics for certified compilers Andrew W. Appel [and seven others] |
title_short | Program logics for certified compilers |
title_sort | program logics for certified compilers |
topic | Computer software / Verification Logic, Symbolic and mathematical Compilers (Computer programs) Compiler (DE-588)4148248-7 gnd Programmverifikation (DE-588)4135576-3 gnd |
topic_facet | Computer software / Verification Logic, Symbolic and mathematical Compilers (Computer programs) Compiler Programmverifikation |
url | https://doi.org/10.1017/CBO9781107256552 |
work_keys_str_mv | AT appelandreww programlogicsforcertifiedcompilers |