000 04890nam a22006135i 4500
001 978-3-642-39634-2
003 DE-He213
005 20200421111654.0
007 cr nn 008mamaa
008 130722s2013 gw | s |||| 0|eng d
020 _a9783642396342
_9978-3-642-39634-2
024 7 _a10.1007/978-3-642-39634-2
_2doi
050 4 _aQA8.9-QA10.3
072 7 _aUYA
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aCOM051010
_2bisacsh
082 0 4 _a005.131
_223
245 1 0 _aInteractive Theorem Proving
_h[electronic resource] :
_b4th International Conference, ITP 2013, Rennes, France, July 22-26, 2013. Proceedings /
_cedited by Sandrine Blazy, Christine Paulin-Mohring, David Pichardie.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _aXII, 498 p. 73 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7998
505 0 _aInvited 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) (S}(B1 -- 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.
520 _aThis 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.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aComputer security.
650 0 _aAlgorithms.
650 0 _aComputer logic.
650 0 _aMathematical logic.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aSoftware Engineering.
650 2 4 _aSystems and Data Security.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
700 1 _aBlazy, Sandrine.
_eeditor.
700 1 _aPaulin-Mohring, Christine.
_eeditor.
700 1 _aPichardie, David.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642396335
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7998
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-39634-2
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c54608
_d54608