Muutke küpsiste eelistusi

E-raamat: Certified Programs and Proofs: Third International Conference, CPP 2013, Melbourne, VIC, Australia, December 11-13,2013, Proceedings

Edited by , Edited by
  • Formaat - PDF+DRM
  • Hind: 55,56 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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.
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-Trakhtenbrots Gap
Theorem.- Certified Kruskals 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.