Theorem Proving in Higher Order Logics

16th International Conference, TPHOLs 2003, Rom, Italy, September 8-12, 2003, Proceedings

Häftad, Engelska, 2003

689 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the refereed proceedings of the 16th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2003, held in Rome, Italy in September 2003.The 24 revised full papers presented together with an invited paper were carefully reviewed and selected from 50 submissions. The papers are organized in topical sections on hardware and Assembler languages, proof automation, fool combination, logic extensions, theorem prover technology, mathematical theories, and security. Among the theorem proving systems discussed are HOL, Coq, MetaPRL, and Isabelle/Isar.

Produktinformation

Utgivningsdatum2003-08-21
Mått155 x 233 x 21 mm
Vikt581 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor366
Upplaga2003
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540406648

Tillhör följande kategorier

Programvaruutveckling inom Data och IT
Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT
Filosofi inom Filosofi och religion

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.