| 000 | 04972nam a22006255i 4500 | ||
|---|---|---|---|
| 001 | 978-3-319-66107-0 | ||
| 003 | DE-He213 | ||
| 005 | 20240423125154.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 170820s2017 sz | s |||| 0|eng d | ||
| 020 |
_a9783319661070 _9978-3-319-66107-0 |
||
| 024 | 7 |
_a10.1007/978-3-319-66107-0 _2doi |
|
| 050 | 4 | _aQA267-268.5 | |
| 072 | 7 |
_aUYA _2bicssc |
|
| 072 | 7 |
_aCOM014000 _2bisacsh |
|
| 072 | 7 |
_aUYA _2thema |
|
| 082 | 0 | 4 |
_a005.131 _223 |
| 245 | 1 | 0 |
_aInteractive Theorem Proving _h[electronic resource] : _b8th International Conference, ITP 2017, Brasília, Brazil, September 26–29, 2017, Proceedings / _cedited by Mauricio Ayala-Rincón, César A. Muñoz. |
| 250 | _a1st ed. 2017. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2017. |
|
| 300 |
_aXIX, 532 p. 79 illus. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v10499 |
|
| 505 | 0 | _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. | |
| 520 | _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. | ||
| 650 | 0 | _aMachine theory. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 |
_aElectronic digital computers _xEvaluation. |
|
| 650 | 0 | _aSoftware engineering. | |
| 650 | 0 | _aCompilers (Computer programs). | |
| 650 | 0 | _aArtificial intelligence. | |
| 650 | 1 | 4 | _aFormal Languages and Automata Theory. |
| 650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
| 650 | 2 | 4 | _aSystem Performance and Evaluation. |
| 650 | 2 | 4 | _aSoftware Engineering. |
| 650 | 2 | 4 | _aCompilers and Interpreters. |
| 650 | 2 | 4 | _aArtificial Intelligence. |
| 700 | 1 |
_aAyala-Rincón, Mauricio. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aMuñoz, César A. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783319661063 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783319661087 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v10499 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-319-66107-0 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cSPRINGER | ||
| 999 |
_c175049 _d175049 |
||