|
|
|
|
| LEADER |
03843nam a22004215i 4500 |
| 001 |
000284937 |
| 005 |
20210823082633.0 |
| 007 |
cr nn 008mamaa |
| 008 |
170820s2017 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783319661070
|
| 024 |
7 |
|
|a 10.1007/978-3-319-66107-0
|2 doi
|
| 040 |
|
|
|a Sistema de Bibliotecas del Tecnológico de Costa Rica
|
| 245 |
1 |
0 |
|a Interactive Theorem Proving :
|b 8th International Conference, ITP 2017, Brasília, Brazil, September 26–29, 2017, Proceedings /
|c edited by Mauricio Ayala-Rincón, César A. Muñoz.
|
| 250 |
|
|
|a 1st ed. 2017.
|
| 260 |
# |
# |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2017.
|
| 300 |
|
|
|a XIX, 532 p. 79 illus. :
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues ;
|v 10499
|
| 505 |
0 |
|
|a Whitebox 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 the Fundamental Group in Untyped Set Theory Using auto2.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Computer system failures.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Programming languages (Electronic computers).
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
1 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a System Performance and Evaluation.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
| 650 |
2 |
4 |
|a Artificial Intelligence.
|
| 700 |
1 |
|
|a Ayala-Rincón, Mauricio.
|e editor.
|0 (orcid)0000-0003-0089-3905
|1 https://orcid.org/0000-0003-0089-3905
|
| 700 |
1 |
|
|a Muñoz, César A.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 900 |
|
|
|a Libro descargado a ALEPH en bloque (proveniente de proveedor)
|