Interactive Theorem Proving : 4th International Conference, ITP 2013, Rennes, France, July 22-26, 2013, Proceedings (Theoretical Computer Science and General Issues) / Blazy, Sandrine (EDT)/ Paulin-Mohring, Christine (EDT)/ Pichardie, David (EDT)

Interactive Theorem Proving : 4th International Conference, ITP 2013, Rennes, France, July 22-26, 2013, Proceedings (Theoretical Computer Science and General Issues) （2013）

個数：

Interactive Theorem Proving : 4th International Conference, ITP 2013, Rennes, France, July 22-26, 2013, Proceedings (Theoretical Computer Science and General Issues) （2013）

Blazy, Sandrine (EDT)/ Paulin-Mohring, Christine (EDT)/ Pichardie, David (EDT)

ウェブストア価格 ¥11,380（本体¥10,346）
Springer-Verlag Berlin and Heidelberg GmbH & Co. K（2013/07発売）
外貨定価 US$ 54.99
ポイント 103pt

提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
【重要ご説明事項】
1. 納期遅延や、ご入手不能となる場合が若干ございます。
2. 複数冊ご注文の場合は、ご注文数量が揃ってからまとめて発送いたします。
3. 美品のご指定は承りかねます。

●3Dセキュア導入とクレジットカードによるお支払いについて

【入荷遅延について】
世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。

◆画像の表紙や帯等は実物とは異なる場合があります。

◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
また、洋書販売価格は、ご注文確定時点での日本円価格となります。
ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。

製本 Paperback:紙装版/ペーパーバック版／ページ数 498 p.
言語 ENG
商品コード 9783642396335
DDC分類 511.36028563

Full Description

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.

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-OrderLogic with Quantified Types.- Implementing Hash-Consed Structures in Coq.- Towards Certifying Network Calculus.- Steps towards Verified Implementations of HOL Light.