Certified Programs and Proofs
Springer International Publishing (Verlag)
978-3-319-03544-4 (ISBN)
Invited Lectures.- pin(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.
Erscheint lt. Verlag | 18.11.2013 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | XII, 309 p. 44 illus. |
Verlagsort | Cham |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 498 g |
Themenwelt | Informatik ► Theorie / Studium ► Compilerbau |
Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik | |
Schlagworte | Coq • Formal Verification • Isabelle/HOL • mechanized proofs • regular languages |
ISBN-10 | 3-319-03544-4 / 3319035444 |
ISBN-13 | 978-3-319-03544-4 / 9783319035444 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich