Cargando…
Certified Programs and Proofs Third International Conference, CPP 2013, Melbourne, VIC, Australia, December 11-13,2013, Proceedings /
This book constitutes the refereed proceedings of the Third International Conference on Certified Programs and Proofs, CPP 2013, colocated with APLAS 2013 held in Melbourne, Australia, in December 2013. The 18 revised regular papers presented together with 1 invited lecture were carefully reviewed a...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor Corporativo: | |
| Otros Autores: | , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cham :
Springer International Publishing : Imprint: Springer,
2013.
|
| Edición: | 1st ed. 2013. |
| Colección: | Theoretical Computer Science and General Issues,
8307 |
| Temas: | |
| Acceso en línea: | Texto Completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-319-03545-1 | ||
| 003 | DE-He213 | ||
| 005 | 20230329142944.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 131209s2013 sz | s |||| 0|eng d | ||
| 020 | |a 9783319035451 |9 978-3-319-03545-1 | ||
| 024 | 7 | |a 10.1007/978-3-319-03545-1 |2 doi | |
| 050 | 4 | |a QA75.5-76.95 | |
| 072 | 7 | |a UYA |2 bicssc | |
| 072 | 7 | |a COM051000 |2 bisacsh | |
| 072 | 7 | |a UYA |2 thema | |
| 082 | 0 | 4 | |a 004.0151 |2 23 |
| 245 | 1 | 0 | |a Certified Programs and Proofs |h [electronic resource] : |b Third International Conference, CPP 2013, Melbourne, VIC, Australia, December 11-13,2013, Proceedings / |c edited by Georges Gonthier, Michael Norrish. |
| 250 | |a 1st ed. 2013. | ||
| 264 | 1 | |a Cham : |b Springer International Publishing : |b Imprint: Springer, |c 2013. | |
| 300 | |a XII, 309 p. 44 illus. |b online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a Theoretical Computer Science and General Issues, |x 2512-2029 ; |v 8307 | |
| 505 | 0 | |a Invited Lectures -- πn(Sn) in Homotopy Type Theory -- Session 1: Code Verification -- Mostly Sound Type System Improves a Foundational Program Verifier -- Computational Verification of Network Programs in Coq -- Aliasing Restrictions of C11 Formalized in Coq -- Session 2: Elegant Proofs -- Proof Pearl: A Verified Bignum Implementation in x86-64 Machine Code -- A Constructive Theory of Regular Languages in Coq -- Certified Parsing of Regular Languages -- Session 3: Proof Libraries -- Nonfree Datatypes in Isabelle/HOL: Animating a Many-Sorted Metatheory -- Lifting and Transfer: A Modular Design for Quotients in Isabelle/HOL -- Refinements for Free! -- Session 4: Mathematics -- A Formal Proof of Borodin-Trakhtenbrot's Gap Theorem -- Certified Kruskal's Tree Theorem -- Extracting Proofs from Tabled Proof Search -- Session 5: Certified Transformations -- Formalizing the SAFECode Type System -- Certifiably Sound Parallelizing Transformations -- Programming Type-Safe Transformations Using Higher-Order Abstract Syntax -- Session 6: Security -- Formalizing Probabilistic Noninterference -- Machine Assisted Proof of ARMv7 Instruction Level Isolation Properties -- A Formal Model and Correctness Proof for an Access Control Policy Framework. | |
| 520 | |a This book constitutes the refereed proceedings of the Third International Conference on Certified Programs and Proofs, CPP 2013, colocated with APLAS 2013 held in Melbourne, Australia, in December 2013. The 18 revised regular papers presented together with 1 invited lecture were carefully reviewed and selected from 39 submissions. The papers are organized in topical sections on code verification, elegant proofs, proof libraries, certified transformations and security. | ||
| 650 | 0 | |a Computer science. | |
| 650 | 0 | |a Machine theory. | |
| 650 | 0 | |a Compilers (Computer programs). | |
| 650 | 0 | |a Computer science-Mathematics. | |
| 650 | 0 | |a Artificial intelligence. | |
| 650 | 1 | 4 | |a Computer Science Logic and Foundations of Programming. |
| 650 | 2 | 4 | |a Formal Languages and Automata Theory. |
| 650 | 2 | 4 | |a Compilers and Interpreters. |
| 650 | 2 | 4 | |a Symbolic and Algebraic Manipulation. |
| 650 | 2 | 4 | |a Artificial Intelligence. |
| 650 | 2 | 4 | |a Computer Science. |
| 700 | 1 | |a Gonthier, Georges. |e editor. |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 700 | 1 | |a Norrish, Michael. |e editor. |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783319035468 |
| 776 | 0 | 8 | |i Printed edition: |z 9783319035444 |
| 830 | 0 | |a Theoretical Computer Science and General Issues, |x 2512-2029 ; |v 8307 | |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1007/978-3-319-03545-1 |z Texto Completo |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 912 | |a ZDB-2-LNC | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||