LEADER 05263nam 22007335 450 001 9910484560503321 005 20251225205419.0 010 $a3-319-66107-8 024 7 $a10.1007/978-3-319-66107-0 035 $a(CKB)4100000000393617 035 $a(DE-He213)978-3-319-66107-0 035 $a(MiAaPQ)EBC5577141 035 $a(PPN)204533406 035 $a(EXLCZ)994100000000393617 100 $a20170820d2017 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aInteractive Theorem Proving $e8th International Conference, ITP 2017, Brasília, Brazil, September 26?29, 2017, Proceedings /$fedited by Mauricio Ayala-Rincón, César A. Muñoz 205 $a1st ed. 2017. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2017. 215 $a1 online resource (XIX, 532 p. 79 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10499 311 08$a3-319-66106-X 320 $aIncludes bibliographical references and index. 327 $aWhitebox Automation -- Automated Theory Exploration for Interactive Theorem Proving: An Introduction to the Hipster System -- Automating Formalization by Statistical and Semantic Parsing of Mathematics -- A Formalization of Convex Polyhedra Based on the Simplex Method -- A Formal Proof of the Expressiveness of Deep Learning -- Formalization of the Lindemann-Weierstrass Theorem -- CompCertS: A Memory-Aware Verified C Compiler Using Pointer as Integer Semantics -- Formal Verification of a Floating-Point Expansion Renormalization Algorithm -- How to Simulate It in Isabelle: Towards Formal Proof for Secure Multi-Party Computation -- FoCaLiZe and Dedukti to the Rescue for Proof Interoperability -- A Formal Proof in Coq of LaSalle's Invariance Principle -- How to Get More out of Your Oracles -- Certifying Standard and Stratified Datalog Inference Engines in SSReect -- Weak Call-by-Value Lambda Calculus as a Model of Computation in Coq -- Bellerophon: Tactical Theorem Proving for Hybrid Systems -- Formalizing Basic Quaternionic Analysis -- A Formalized General Theory of Syntax with Bindings -- Proof Certificates in PVS -- Efficient, Verified Checking of Propositional Proofs -- Proof Tactics for Assertions in Separation Logic -- Categoricity Results for Second-Order ZF in Dependent Type Theory -- Making PVS Accessible to Generic Services by Interpretation in a Universal Format -- Formally Verified Safe Vertical Maneuvers for Non-Deterministic, Accelerating Aircraft Dynamics -- Using Abstract Stobjs in ACL2 to Compute Matrix Normal Forms -- Typing Total Recursive Functions in Coq -- Effect Polymorphism in Higher-Order Logic (Proof Pearl) -- Schulze Voting as Evidence Carrying Computation -- Verified Spilling and Translation Validation with Repair -- A Verified Generational Garbage Collector for CakeML -- A Formalisation of Consistent Consequence for Boolean Equation Systems -- Homotopy Type Theory in Lean -- Verifying a Concurrent Garbage Collector Using a Rely-Guarantee Methodology -- Formalization of theFundamental Group in Untyped Set Theory Using auto2. 330 $aThis book constitutes the refereed proceedings of the 8th International Conference on Interactive Theorem Proving, ITP 2017, held in Brasilia, Brazil, in September 2017. The 28 full papers, 2 rough diamond papers, and 3 invited talk papers presented were carefully reviewed and selected from 65 submissions. The topics range from theoretical foundations to implementation aspects and applications in program verification, security and formalization of mathematical theories. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10499 606 $aMachine theory 606 $aComputer science 606 $aElectronic digital computers$xEvaluation 606 $aSoftware engineering 606 $aCompilers (Computer programs) 606 $aArtificial intelligence 606 $aFormal Languages and Automata Theory 606 $aComputer Science Logic and Foundations of Programming 606 $aSystem Performance and Evaluation 606 $aSoftware Engineering 606 $aCompilers and Interpreters 606 $aArtificial Intelligence 615 0$aMachine theory. 615 0$aComputer science. 615 0$aElectronic digital computers$xEvaluation. 615 0$aSoftware engineering. 615 0$aCompilers (Computer programs). 615 0$aArtificial intelligence. 615 14$aFormal Languages and Automata Theory. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aSystem Performance and Evaluation. 615 24$aSoftware Engineering. 615 24$aCompilers and Interpreters. 615 24$aArtificial Intelligence. 676 $a511.36028563 702 $aAyala-Rinco?n$b M$g(Mauricio),$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMun?oz$b Ce?sar A.$f1968-$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484560503321 996 $aInteractive Theorem Proving$92010767 997 $aUNINA