Muutke küpsiste eelistusi

E-raamat: Interactive Theorem Proving: 6th International Conference, ITP 2015, Nanjing, China, August 24-27, 2015, 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 proceedings of the 6th International Conference on Interactive Theorem Proving, ITP 2015, held in Nanjing, China, in August 2015. The 27 papers presented in this volume were carefully reviewed and selected from 54 submissions. The topics range from theoretical foundations to implementation aspects and applications in program verification, security and formalization of mathematics.

Verified, Practical Upper Bounds for State Space Diameters.- Formalization of Error-correcting Codes: from Hamming to Modern Coding Theory.- ROSCoq: Robots powered by Constructive Reals.- Asynchronous processing of Coq documents: from the kernel up to the user interface.- A Concrete Memory Model for CompCert.- Validating Dominator Trees for a Fast, Verified Dominance Test.- Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra.- Mechanisation of AKS Algorithm.- Machine-Checked Verification of the Correctness and Amortized.- Improved Tool Support for Machine-Code Decompilation in HOL4.- A Formalized Hierarchy of Probabilistic System Types.- Learning To Parse on Aligned Corpora.- A Consistent Foundation for Isabelle/HOL.- Foundational Property-Based Testing.- A First-Order Functional Intermediate Language for Verified Compilers.- Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions.- ModuRes: a Coq Library for Modular Reasoning about Concurrent.- Higher-Order Imperative Programming Languages.- Transfinite Constructions in Classical Type Theory.- A Mechanized Theory of regular trees in dependent type theory.- Deriving Comparators and Show-Functions in Isabelle/HOL.- Formalizing Knot Theory in Isabelle/HOL.- Pattern Matches in HOL: A New Representation and Improved Code Generation.