| Description |
1 online resource (xii, 498 pages) : illustrations |
| Series |
Lecture Notes in Computer Science, 0302-9743 ; 7998 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 7998.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Invited Talks. Applying Formal Methods in the Large / Dominique Bolignano -- Automating Theorem Proving with SMT / K. Rustan M. Leino -- Certifying Voting Protocols / Carsten Schürmann -- Invited Tutorials. Counterexample Generation Meets Interactive Theorem Proving: Current Results and Future Opportunities / Panagiotis Manolios -- Canonical Structures for the Working Coq User / Assia Mahboubi, Enrico Tassi -- Regular Papers. MaSh: Machine Learning for Sledgehammer / Daniel Kühlwein [and others] -- Scalable LCF-Style Proof Translation / Cezary Kaliszyk, Alexander Krauss -- Lightweight Proof by Reflection Using a Posteriori Simulation of Effectful Computation / Guillaume Claret [and others] -- Automatic Data Refinement / Peter Lammich -- Data Refinement in Isabelle/HOL / Florian Haftmann [and others] -- Light-Weight Containers for Isabelle: Efficient, Extensible, Nestable / Andreas Lochbihler |
|
880-01 Type Classes and Filters for Mathematical Analysis in Isabelle/HOL / Johannes Hölzl, Fabian Immler, Brian Huffman -- Formal Reasoning about Classified Markov Chains in HOL / Liya Liu [and others] -- Practical Probability: Applying pGCL to Lattice Scheduling / David Cock -- Adjustable References / Viktor Vafeiadis -- Handcrafted Inversions Made Operational on Operational Semantics / Jean-François Monin, Xiaomu Shi -- Circular Coinduction in Coq Using Bisimulation-Up-To Techniques / Jörg Endrullis, Dimitri Hendriks, Martin Bodin -- Program Extraction from Nested Definitions / Kenji Miyamoto, Fredrik Nordvall Forsberg, Helmut Schwichtenberg -- Subformula Linking as an Interaction Method / Kaustuv Chaudhuri -- Automatically Generated Infrastructure for De Bruijn Syntaxes / Emmanuel Polonowski -- Shared-Memory Multiprocessing for Interactive Theorem Proving / Makarius Wenzel -- A Parallelized Theorem Prover for a Logic with Parallel Execution / David L. Rager, Warren A. Hunt Jr., Matt Kaufmann |
|
880-01/(S Ordinals in HOL: Transfinite Arithmetic up to (and Beyond) ω 1 / Michael Norrish, Brian Huffman -- Mechanising Turing Machines and Computability Theory in Isabelle/HOL / Jian Xu, Xingyuan Zhang, Christian Urban -- A Machine-Checked Proof of the Odd Order Theorem / Georges Gonthier [and others] -- Kleene Algebra with Tests and Coq Tools for while Programs / Damien Pous -- Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL / Alasdair Armstrong, Georg Struth, Tjark Weber -- Pragmatic Quotient Types in Coq / Cyril Cohen -- Mechanical Verification of SAT Refutations with Extended Resolution / Nathan Wetzler, Marijn J.H. Heule, Warren A. Hunt Jr. -- Formalizing Bounded Increase / René Thiemann -- Formal Program Optimization in Nuprl Using Computational Equivalence and Partial Types / Vincent Rahli, Mark Bickford, Abhishek Anand |
|
Rough Diamonds. Communicating Formal Proofs: The Case of Flyspeck / Carst Tankink [and others] -- Square Root and Division Elimination in PVS / Pierre Neron -- The Picard Algorithm for Ordinary Differential Equations in Coq / Evgeny Makarov, Bas Spitters -- Stateless Higher-Order Logic with Quantified Types / Evan Austin, Perry Alexander -- Implementing Hash-Consed Structures in Coq / Thomas Braibant, Jacques-Henri Jourdan, David Monniaux -- Towards Certifying Network Calculus / Etienne Mabille [and others] -- Steps towards Verified Implementations of HOL Light / Magnus O. Myreen, Scott Owens, Ramana Kumar |
|
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 |
| Summary |
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 |
| Notes |
International conference proceedings |
|
Includes author index |
| Bibliography |
Includes author index |
| Notes |
English |
|
Online resource; title from PDF title page (SpringerLink, viewed August 20, 2013) |
| In |
Springer eBooks |
| Subject |
Automatic theorem proving -- Congresses
|
|
Logic, Symbolic and mathematical -- Congresses
|
|
Mathematics.
|
|
Logic.
|
|
Artificial intelligence.
|
|
Mathematics
|
|
Logic
|
|
Artificial Intelligence
|
|
logic.
|
|
artificial intelligence.
|
|
Mathematics
|
|
Logic
|
|
Artificial intelligence
|
|
Automatic theorem proving
|
|
Logic, Symbolic and mathematical
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Blazy, Sandrine, editor
|
|
Paulin-Mohring, Christine, 1962- editor.
|
|
Pichardie, David, editor
|
| ISBN |
9783642396342 |
|
3642396348 |
|
364239633X |
|
9783642396335 |
|
