|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-642-14052-5 |
| 003 |
DE-He213 |
| 005 |
20230221090422.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100712s2010 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642140525
|9 978-3-642-14052-5
|
| 024 |
7 |
|
|a 10.1007/978-3-642-14052-5
|2 doi
|
| 050 |
|
4 |
|a QA75.5-76.95
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a COM051000
|2 bisacsh
|
| 072 |
|
7 |
|a UYA
|2 thema
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 245 |
1 |
0 |
|a Interactive Theorem Proving
|h [electronic resource] :
|b First International Conference, ITP 2010 Edinburgh, UK, July 11-14, 2010, Proceedings /
|c edited by Matt Kaufmann, Lawrence C. Paulson.
|
| 250 |
|
|
|a 1st ed. 2010.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2010.
|
| 300 |
|
|
|a XI, 495 p. 82 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
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 6172
|
| 505 |
0 |
|
|a Invited 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.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
|
0 |
|a Compilers (Computer programs).
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
|
0 |
|a Immunospecificity.
|
| 650 |
1 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
| 650 |
2 |
4 |
|a Compilers and Interpreters.
|
| 650 |
2 |
4 |
|a Artificial Intelligence.
|
| 650 |
2 |
4 |
|a Adaptive Immunity.
|
| 700 |
1 |
|
|a Kaufmann, Matt.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Paulson, Lawrence C.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642140518
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642140532
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 6172
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-642-14052-5
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
