Theorem Proving in Higher Order Logics
Editat de David Basin, Burkhart Wolffen Limba Engleză Paperback – 21 aug 2003
Preț: 380.09 lei
Nou
Puncte Express: 570
Preț estimativ în valută:
67.26€ • 78.87$ • 59.07£
67.26€ • 78.87$ • 59.07£
Carte tipărită la comandă
Livrare economică 07-21 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540406648
ISBN-10: 3540406646
Pagini: 384
Ilustrații: X, 366 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.58 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540406646
Pagini: 384
Ilustrații: X, 366 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.58 kg
Ediția:2003
Editura: Springer
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.