Theorem Proving in Higher Order Logics: 16th International Conference, TPHOLs 2003, Rom, Italy, September 8-12, 2003, Proceedings: Lecture Notes in Computer Science, cartea 2758
Editat de David Basin, Burkhart Wolffen Limba Engleză Paperback – 21 aug 2003
Din seria Lecture Notes in Computer Science
- 15% Preț: 549.48 lei
- 20% Preț: 322.44 lei
- 20% Preț: 324.00 lei
- 20% Preț: 315.78 lei
- 20% Preț: 238.01 lei
- 20% Preț: 1017.66 lei
- 20% Preț: 322.44 lei
- 20% Preț: 438.69 lei
- 20% Preț: 548.35 lei
- 20% Preț: 325.58 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 315.19 lei
- 20% Preț: 1005.39 lei
- 20% Preț: 554.59 lei
- 17% Preț: 360.19 lei
- 20% Preț: 620.45 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1120.51 lei
- 20% Preț: 560.32 lei
- 20% Preț: 611.22 lei
- 20% Preț: 319.10 lei
- 20% Preț: 552.64 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 1339.86 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.78 lei
- Preț: 361.23 lei
- 20% Preț: 969.58 lei
- 20% Preț: 256.27 lei
- 20% Preț: 782.28 lei
- 20% Preț: 301.95 lei
- 20% Preț: 504.57 lei
- 20% Preț: 722.90 lei
- 20% Preț: 369.12 lei
- 20% Preț: 334.72 lei
- 20% Preț: 550.29 lei
- Preț: 389.06 lei
- 20% Preț: 564.99 lei
- 20% Preț: 552.25 lei
- 20% Preț: 552.25 lei
- 20% Preț: 722.40 lei
- 20% Preț: 331.59 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 372.52 lei
Nou
Puncte Express: 559
Preț estimativ în valută:
71.31€ • 77.69$ • 59.82£
71.31€ • 77.69$ • 59.82£
Carte tipărită la comandă
Livrare economică 19 decembrie 24 - 02 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540406648
ISBN-10: 3540406646
Pagini: 384
Ilustrații: X, 366 p.
Dimensiuni: 155 x 233 x 20 mm
Greutate: 0.54 kg
Ediția:2003
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540406646
Pagini: 384
Ilustrații: X, 366 p.
Dimensiuni: 155 x 233 x 20 mm
Greutate: 0.54 kg
Ediția:2003
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Talk I.- Click’n Prove: Interactive Proofs within Set Theory.- Hardware and Assembler Languages.- Formal Specification and Verification of ARM6.- A Programming Logic for Java Bytecode Programs.- Verified Bytecode Subroutines.- Proof Automation I.- Complete Integer Decision Procedures as Derived Rules in HOL.- Changing Data Representation within the Coq System.- Applications of Polytypism in Theorem Proving.- Proof Automation II.- A Coverage Checking Algorithm for LF.- Automatic Generation of Generalization Lemmas for Proving Properties of Tail-Recursive Definitions.- Tool Combination.- Embedding of Systems of Affine Recurrence Equations in Coq.- Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover.- Combining Testing and Proving in Dependent Type Theory.- Invited Talk II.- Reasoning about Proof Search Specifications: An Abstract.- Logic Extensions.- Program Extraction from Large Proof Developments.- First Order Logic with Domain Conditions.- Extending Higher-Order Unification to Support Proof Irrelevance.- Advances in Theorem Prover Technology.- Inductive Invariants for Nested Recursion.- Implementing Modules in the Coq System.- MetaPRL – A Modular Logical Environment.- Mathematical Theories.- Proving Pearl: Knuth’s Algorithm for Prime Numbers.- Formalizing Hilbert’s Grundlagen in Isabelle/Isar.- Security.- Using Coq to Verify Java CardTM Applet Isolation Properties.- Verifying Second-Level Security Protocols.