Del 9236 - Lecture Notes in Computer Science

Interactive Theorem Proving

6th International Conference, ITP 2015, Nanjing, China, August 24-27, 2015, Proceedings

Häftad, Engelska, 2015

709 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the proceedings of the 6th International Conference on Interactive Theorem Proving, ITP 2015, held in Nanjing, China, in August 2015. The topics range from theoretical foundations to implementation aspects and applications in program verification, security and formalization of mathematics.

Produktinformation

Utgivningsdatum2015-08-27
Mått155 x 235 x 27 mm
Vikt727 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor469
FörlagSpringer International Publishing AG
ISBN9783319221014

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT
Programmeringsböcker inom Data och IT
Programvaruutveckling inom Data och IT
IT-säkerhet inom Data och IT
Nätverk och kommunikation inom Data och IT

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.