LEADER 06627nam 22008535 450 001 9910483708703321 005 20251226202606.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(BIP)31063942 035 $a(EXLCZ)992550000000015590 100 $a20100712d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aInteractive Theorem Proving $eFirst International Conference, ITP 2010 Edinburgh, UK, July 11-14, 2010, Proceedings /$fedited by Matt Kaufmann, Lawrence C. Paulson 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XI, 495 p. 82 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6172 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$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. 330 $aThis volume contains the papers presented at ITP 2010: the First International ConferenceonInteractiveTheoremProving. It washeldduring July11-14,2010 in Edinburgh, Scotland as part of the Federated Logic Conference (FLoC, July 9-21, 2010) alongside the other FLoC conferences and workshops. ITP combines the communities of two venerable meetings: the TPHOLs c- ference and the ACL2 workshop. The former conference originated in 1988 as a workshop for users of the HOL proof assistant. The ?rst two meetings were at the University of Cambridge, but afterwards they were held in a variety of venues. By 1992, the workshop acquired the name Higher-Order Logic Theorem Proving and Its Applications. In 1996, it was christened anew as Theorem Pr- ing in Higher-Order Logics, TPHOLs for short, and was henceforth organizedas a conference. Each of these transitions broadened the meeting's scope from the original HOL system to include other proof assistants based on forms of high- order logic, including Coq, Isabelle and PVS. TPHOLs has regularly published research done using ACL2 (the modern version of the well-known Boyer-Moore theorem prover), even though ACL2 implements a unique computational form of ?rst-order logic. The ACL2 community has run its own series of workshops since1999. BymergingTPHOLswith the ACL2workshop,weinclude a broader community of researchers who work with interactive proof tools. With our enlarged community, it was not surprising that ITP attracted a record-breaking 74 submissions, each of which was reviewed by at least three Programme Committee members. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6172 606 $aComputer science 606 $aSoftware engineering 606 $aMachine theory 606 $aCompilers (Computer programs) 606 $aArtificial intelligence 606 $aImmunospecificity 606 $aComputer Science Logic and Foundations of Programming 606 $aSoftware Engineering 606 $aFormal Languages and Automata Theory 606 $aCompilers and Interpreters 606 $aArtificial Intelligence 606 $aAdaptive Immunity 615 0$aComputer science. 615 0$aSoftware engineering. 615 0$aMachine theory. 615 0$aCompilers (Computer programs). 615 0$aArtificial intelligence. 615 0$aImmunospecificity. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aSoftware Engineering. 615 24$aFormal Languages and Automata Theory. 615 24$aCompilers and Interpreters. 615 24$aArtificial Intelligence. 615 24$aAdaptive Immunity. 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