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

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.

Table des matières

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.

Résumé

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.

Détails du produit

• Collaboration: Christia Urban (Editeur), Christian Urban (Editeur), Zhang (Editeur), Zhang (Editeur), Xingyuan Zhang (Editeur)
• Edition: Springer, Berlin
• Langues: Anglais
• Format d'édition: Livre de poche
• Sortie: 01.01.2015
• EAN: 9783319221014
• ISBN: 978-3-31-922101-4
• Pages: 469
• Dimensions: 156 mm x 235 mm x 28 mm
• Poids: 727 g
• Illustrations: XI, 469 p. 63 illus.
• Thèmes: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Theoretical Computer Science and General Issues
• Catégories: Sciences naturelles, médecine, informatique, technique > Informatique, ordinateurs > Informatique; Computersicherheit, C, Künstliche Intelligenz, Algorithmen und Datenstrukturen, Netzwerksicherheit, Software Engineering, Algorithms, Artificial Intelligence, computer science, VALIDATION, Systems and Data Security, Data and Information Security, Logics and Meanings of Programs, Algorithms & data structures, Network Security, Computer security, Computer programming / software engineering, Algorithm Analysis and Problem Complexity, Mathematical logic, Mathematical Logic and Formal Languages, Computer architecture & logic design, Computer logic, Computer Science Logic and Foundations of Programming, Formal Languages and Automata Theory