Interactive Theorem Proving: First International Conference, ITP 2010 Edinburgh, UK, July 11-14, 2010, Proceedings: Lecture Notes in Computer Science, cartea 6172
Editat de Matt Kaufmann, Lawrence C. Paulsonen Limba Engleză Paperback – 30 iun 2010
Din seria Lecture Notes in Computer Science
- 20%
Preț: 1020.28 lei -
Preț: 395.25 lei - 20%
Preț: 327.36 lei - 20%
Preț: 556.96 lei - 20%
Preț: 400.77 lei - 15%
Preț: 558.12 lei - 20%
Preț: 328.94 lei - 20%
Preț: 340.04 lei - 20%
Preț: 487.46 lei - 20%
Preț: 629.71 lei - 20%
Preț: 386.08 lei - 20%
Preț: 489.11 lei - 20%
Preț: 620.33 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 782.57 lei - 20%
Preț: 679.09 lei - 20%
Preț: 330.54 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 435.28 lei - 20%
Preț: 375.72 lei - 20%
Preț: 342.61 lei - 20%
Preț: 432.78 lei - 20%
Preț: 904.16 lei - 20%
Preț: 1391.87 lei - 20%
Preț: 373.80 lei - 20%
Preț: 400.17 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 984.64 lei - 20%
Preț: 560.93 lei - 20%
Preț: 731.97 lei - 20%
Preț: 563.29 lei - 20%
Preț: 403.00 lei - 20%
Preț: 793.92 lei - 20%
Preț: 324.19 lei - 20%
Preț: 733.68 lei - 20%
Preț: 336.86 lei - 20%
Preț: 327.36 lei - 20%
Preț: 573.45 lei - 20%
Preț: 558.53 lei - 20%
Preț: 850.42 lei - 20%
Preț: 560.93 lei - 20%
Preț: 560.93 lei - 20%
Preț: 631.96 lei - 20%
Preț: 568.70 lei - 20%
Preț: 488.90 lei - 20%
Preț: 293.24 lei
Preț: 632.89 lei
Preț vechi: 791.11 lei
-20%
Puncte Express: 949
Preț estimativ în valută:
111.88€ • 133.40$ • 97.04£
111.88€ • 133.40$ • 97.04£
Carte disponibilă
Livrare economică 23 februarie-09 martie
Specificații
ISBN-13: 9783642140518
ISBN-10: 3642140513
Pagini: 495
Ilustrații: XI, 495 p. 82 illus.
Greutate: 0.77 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642140513
Pagini: 495
Ilustrații: XI, 495 p. 82 illus.
Greutate: 0.77 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
Professional/practitionerCuprins
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.