LEADER 04164nam 2200589 a 450 001 9910483708703321 005 20200520144314.0 010 $a1-280-38759-9 010 $a9786613565518 010 $a3-642-14052-1 024 7 $a10.1007/978-3-642-14052-5 035 $a(CKB)2550000000015590 035 $a(SSID)ssj0000399488 035 $a(PQKBManifestationID)11279260 035 $a(PQKBTitleCode)TC0000399488 035 $a(PQKBWorkID)10374971 035 $a(PQKB)10478333 035 $a(DE-He213)978-3-642-14052-5 035 $a(MiAaPQ)EBC3065525 035 $a(PPN)149072910 035 $a(EXLCZ)992550000000015590 100 $a20100908d2010 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aInteractive theorem proving $e1st International Conference, ITP 2010, Edinburgh, UK, July 11-14, 2010 : proceedings /$fMatt Kaufmann, Lawrence C. Paulson, (eds.) 205 $a1st ed. 2010. 210 $aBerlin $cSpringer$d2010 215 $a1 online resource (XI, 495 p. 82 illus.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v6172 225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-14051-3 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- A Formally Verified OS Kernel. Now What? -- Proof Assistants as Teaching Assistants: A View from the Trenches -- Proof Pearls -- A Certified Denotational Abstract Interpreter -- Using a First Order Logic to Verify That Some Set of Reals Has No Lesbegue Measure -- A New Foundation for Nominal Isabelle -- (Nominal) Unification by Recursive Descent with Triangular Substitutions -- A Formal Proof of a Necessary and Sufficient Condition for Deadlock-Free Adaptive Networks -- Regular Papers -- Extending Coq with Imperative Features and Its Application to SAT Verification -- A Tactic Language for Declarative Proofs -- Programming Language Techniques for Cryptographic Proofs -- Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder -- Formal Proof of a Wave Equation Resolution Scheme: The Method Error -- An Efficient Coq Tactic for Deciding Kleene Algebras -- Fast LCF-Style Proof Reconstruction for Z3 -- The Optimal Fixed Point Combinator -- Formal Study of Plane Delaunay Triangulation -- Reasoning with Higher-Order Abstract Syntax and Contexts: A Comparison -- A Trustworthy Monadic Formalization of the ARMv7 Instruction Set Architecture -- Automated Machine-Checked Hybrid System Safety Proofs -- Coverset Induction with Partiality and Subsorts: A Powerlist Case Study -- Case-Analysis for Rippling and Inductive Proof -- Importing HOL Light into Coq -- A Mechanized Translation from Higher-Order Logic to Set Theory -- The Isabelle Collections Framework -- Interactive Termination Proofs Using Termination Cores -- A Framework for Formal Verification of Compiler Optimizations -- On the Formalization of the Lebesgue Integration Theory in HOL -- From Total Store Order to Sequential Consistency: A Practical Reduction Theorem -- Equations: A Dependent Pattern-Matching Compiler -- A Mechanically Verified AIG-to-BDD Conversion Algorithm -- Inductive Consequences in the Calculus of Constructions -- Validating QBF Invalidity in HOL4 -- Rough Diamonds -- Higher-Order Abstract Syntax in Isabelle/HOL -- Separation Logic Adapted for Proofs by Rewriting -- Developing the Algebraic Hierarchy with Type Classes in Coq. 410 0$aLecture notes in computer science ;$v6172. 410 0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues. 606 $aAutomatic theorem proving$vCongresses 615 0$aAutomatic theorem proving 676 $a005.1015113 701 $aKaufmann$b Matt$01756810 701 $aPaulson$b Lawrence C$062096 712 12$aITP (Conference) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483708703321 996 $aInteractive theorem proving$94194334 997 $aUNINA