1 option
Interactive Theorem Proving : 6th International Conference, ITP 2015, Nanjing, China, August 24-27, 2015, Proceedings / edited by Christian Urban, Xingyuan Zhang.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 9236
- Theoretical Computer Science and General Issues, 2512-2029 ; 9236
- Language:
- English
- Subjects (All):
- Machine theory.
- Artificial intelligence.
- Computer science.
- Software engineering.
- Data protection.
- Algorithms.
- Formal Languages and Automata Theory.
- Artificial Intelligence.
- Computer Science Logic and Foundations of Programming.
- Software Engineering.
- Data and Information Security.
- Local Subjects:
- Formal Languages and Automata Theory.
- Artificial Intelligence.
- Computer Science Logic and Foundations of Programming.
- Software Engineering.
- Data and Information Security.
- Algorithms.
- Physical Description:
- 1 online resource (XI, 469 pages) : 63 illustrations
- Edition:
- 1st ed. 2015.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2015.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-22102-1
- 9783319221021
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.