|
![]() |
|||
|
||||
OverviewTHis book constitutes the refereed proceedings of the 17th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2004, held in Park City, Utah, USA in September 2004. The 21 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 42 submissions. Among the topics addressed are theorem proving, verification, inductive types, automated deduction, mechanized proofs, mathematical logic, proof theory, type systems, computability, program verification, ACL, Cop, Isabelle/HOL, recursive functions, integration theory, machine code safety certification, and abstraction. Full Product DetailsAuthor: Konrad Slind , Annette Bunker , Ganesh C. GopalakrishnanPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 2004 ed. Volume: 3223 Dimensions: Width: 15.50cm , Height: 1.80cm , Length: 23.50cm Weight: 1.100kg ISBN: 9783540230175ISBN 10: 3540230173 Pages: 340 Publication Date: 01 September 2004 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsError Analysis of Digital Filters Using Theorem Proving.- Verifying Uniqueness in a Logical Framework.- A Program Logic for Resource Verification.- Proof Reuse with Extended Inductive Types.- Hierarchical Reflection.- Correct Embedded Computing Futures.- Higher Order Rippling in IsaPlanner.- A Mechanical Proof of the Cook-Levin Theorem.- Formalizing the Proof of the Kepler Conjecture.- Interfacing Hoare Logic and Type Systems for Foundational Proof-Carrying Code.- Extensible Hierarchical Tactic Construction in a Logical Framework.- Theorem Reuse by Proof Term Transformation.- Proving Compatibility Using Refinement.- Java Program Verification via a JVM Deep Embedding in ACL2.- Reasoning About CBV Functional Programs in Isabelle/HOL.- Proof Pearl: From Concrete to Functional Unparsing.- A Decision Procedure for Geometry in Coq.- Recursive Function Definition for Types with Binders.- Abstractions for Fault-Tolerant Distributed System Verification.- Formalizing Integration Theory with an Application to Probabilistic Algorithms.- Formalizing Java Dynamic Loading in HOL.- Certifying Machine Code Safety: Shallow Versus Deep Embedding.- Term Algebras with Length Function and Bounded Quantifier Alternation.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |