Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Interactive Theorem Proving - 4th International Conference, ITP 2013, Rennes, France, July 22-26,

Interactive Theorem Proving

4th International Conference, ITP 2013, Rennes, France, July 22-26, 2013, Proceedings

Blazy, Sandrine, Paulin-Mohring, Christine, Pichardie, David (Eds.)

2013, XII, 498 p. 73 illus.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$79.99

(net) price for USA

ISBN 978-3-642-39634-2

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$107.00

(net) price for USA

ISBN 978-3-642-39633-5

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  •  Fast-track conference proceedings of ITP 2013
This book constitutes the refereed proceedings of the 4th International Conference on Interactive Theorem Proving, ITP 2013, held in Rennes, France, in July 2013.
The 26 regular full papers presented together with 7 rough diamond papers, 3 invited talks, and 2 invited tutorials were carefully reviewed and selected from 66 submissions. The papers are organized in topical sections such as program verfication, security, formalization of mathematics and theorem prover development.

Content Level » Research

Keywords » Coq - distributed processes - functional language - parallel execution for a formal logic - rewriting

Related subjects » Artificial Intelligence - Security and Cryptology - Software Engineering - Theoretical Computer Science

Table of contents 

Invited Talks.- Applying Formal Methods in the Large.- Automating Theorem Proving with SMT.- Certifying Voting Protocols.- Invited Tutorials.-Counterexample Generation Meets Interactive Theorem Proving: Current Results and Future Opportunities.- Canonical Structures for the Working Coq User.- Regular Papers.- MaSh: Machine Learning for Sledgehammer.- Scalable LCF-Style Proof Translation.- Lightweight Proof by Reflection Using a Posteriori Simulation of Effectful Computation.- Automatic Data Refinement.- Data Refinement in Isabelle/HOL.- Light-Weight Containers for Isabelle: Efficient, Extensible, Nestable.- Ordinals in HOL: Transfinite Arithmetic up to (and Beyond) ω1.- Mechanising Turing Machines and Computability Theory in Isabelle/HOL.-A Machine-Checked Proof of the Odd Order Theorem.- Kleene Algebra with Tests and Coq Tools for while Programs.-Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL.- Pragmatic Quotient Types in Coq.- Mechanical Verification of SAT Refutations with Extended Resolution.- Formalizing Bounded Increase.- Formal Program Optimization in Nuprl Using Computational Equivalence and Partial Types.- Type Classes and Filters for Mathematical Analysis in Isabelle/HOL.- Formal Reasoning about Classified Markov Chains in HOL.- Practical Probability: Applying pGCL to Lattice Scheduling.- Adjustable References.- Handcrafted Inversions Made Operational on Operational Semantics.- Circular Coinduction in Coq Using Bisimulation-Up-To Techniques.- Program Extraction from Nested Definitions.- Subformula Linking as an Interaction Method.- Automatically Generated Infrastructure for De Bruijn Syntaxes.- Shared-Memory Multiprocessing for Interactive Theorem Proving.- A Parallelized Theorem Prover for a Logic with Parallel Execution.- Rough Diamonds.- Communicating Formal Proofs: The Case of Flyspeck.- Square Root and Division Elimination in PVS.- The Picard Algorithm for Ordinary Differential Equations in Coq.- Stateless Higher-Order Logic with Quantified Types.- Implementing Hash-Consed Structures in Coq.- Towards Certifying Network Calculus.- Steps towards Verified Implementations of HOL Light.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Mathematical Logic and Formal Languages.