LEADER 05447nam 22007935 450 001 9910483576603321 005 20230329191209.0 010 $a3-319-08970-6 024 7 $a10.1007/978-3-319-08970-6 035 $a(CKB)3710000000143901 035 $a(SSID)ssj0001276170 035 $a(PQKBManifestationID)11836027 035 $a(PQKBTitleCode)TC0001276170 035 $a(PQKBWorkID)11238628 035 $a(PQKB)10523525 035 $a(DE-He213)978-3-319-08970-6 035 $a(MiAaPQ)EBC3092950 035 $a(PPN)179766678 035 $a(EXLCZ)993710000000143901 100 $a20140628d2014 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aInteractive Theorem Proving $e5th International Conference, ITP 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014, Proceedings /$fedited by Gerwin Klein, Ruben Gamboa 205 $a1st ed. 2014. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2014. 215 $a1 online resource (XXII, 555 p. 90 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8558 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-319-08969-2 327 $aMicrocode Verification ? Another Piece of the Microprocessor Verification Puzzle -- Are We There Yet? 20 Years of Industrial Theorem Proving with SPARK -- Towards a Formally Verified Proof Assistant -- Implicational Rewriting Tactics in HOL -- A Heuristic Prover for Real Inequalities -- A Formal Library for Elliptic Curves in the Coq Proof Assistant -- Truly Modular (Co) data types for Isabelle/HOL -- Cardinals in Isabelle/HOL -- Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code -- Showing Invariance Compositionally for a Process Algebra for Network Protocols -- A Computer-Algebra-Based Formal Proof of the Irrationality of ?(3) -- From Operational Models to Information Theory; Side Channels in pGCL with Isabelle -- A Coq Formalization of Finitely Presented Modules -- Formalized, Effective Domain Theory in Coq -- Completeness and Decidability Results for CTL in Coq -- Hypermap Specification and Certified Linked Implementation Using Orbits -- A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction -- Experience Implementing a Performant Category-Theory Library in Coq -- A New and Formalized Proof of Abstract Completion -- HOL with Definitions: Semantics, Soundness and a Verified Implementation -- Verified Efficient Implementation of Gabow?s Strongly Connected Component Algorithm -- Recursive Functions on Lazy Lists via Domains and Topologies -- Formal Verification of Optical Quantum Flip Gate -- Compositional Computational Reflection -- An Isabelle Proof Method Language -- Proof Pearl: Proving a Simple Von Neumann Machine Turing Complete -- The Reflective Milawa Theorem Prover Is Sound (Down to the Machine Code That Runs It) -- Balancing Lists: A Proof Pearl -- Unified Decision Procedures for Regular Expression Equivalence -- Collaborative Interactive Theorem Proving with Clide -- On the Formalization of Z-Transform in HOL -- Universe Polymorphism in Coq -- Asynchronous User Interaction and Tool Integration in Isabelle/PIDE -- HOL Constant Definition Done Right -- Rough Diamond: An Extension of Equivalence-Based Rewriting -- Formal C Semantics: Comp Cert and the C Standard -- Mechanical Certification of Loop Pipelining Transformations: A Preview. 330 $aThis book constitutes the proceedings of the 5th International Conference on Interactive Theorem Proving, ITP 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, in Vienna, Austria, in July 2014. The 35 papers presented in this volume were carefully reviewed and selected from 59 submissions. The topics range from theoretical foundations to implementation aspects and applications in program verification, security and formalization of mathematics. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8558 606 $aMachine theory 606 $aArtificial intelligence 606 $aComputer science 606 $aSoftware engineering 606 $aData protection 606 $aAlgorithms 606 $aFormal Languages and Automata Theory 606 $aArtificial Intelligence 606 $aComputer Science Logic and Foundations of Programming 606 $aSoftware Engineering 606 $aData and Information Security 606 $aAlgorithms 615 0$aMachine theory. 615 0$aArtificial intelligence. 615 0$aComputer science. 615 0$aSoftware engineering. 615 0$aData protection. 615 0$aAlgorithms. 615 14$aFormal Languages and Automata Theory. 615 24$aArtificial Intelligence. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aSoftware Engineering. 615 24$aData and Information Security. 615 24$aAlgorithms. 676 $a004.015113 702 $aKlein$b Gerwin$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aGamboa$b Ruben$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483576603321 996 $aInteractive Theorem Proving$92010767 997 $aUNINA