Theorem Proving in Higher Order Logics

13th International Conference, TPHOLs 2000 Portland, OR, USA, August 14-18, 2000 Proceedings

Häftad, Engelska, 2000

Av Mark Aagaard, John Harrison, Mark D. Aagaard

729 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 13th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2000, held in Portland, Oregon, USA in August 2000. The 29 revised full papers presented together with three invited contributions were carefully reviewed and selected from 55 submissions. All current aspects of HOL theorem proving, formal verification of hardware and software systems, and formal verification are covered. Among the HOL theorem provers evaluated are COQ, HOL, Isabelle, HOL/SPIN, PVS, and Isabelle/HOL.

Produktinformation

Utgivningsdatum2000-07-27
Mått155 x 233 x 30 mm
Vikt826 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor539
Upplaga2000
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540678632

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programspråk inom Data och it
Programmeringsböcker inom Data och it
Programvaruutveckling inom Data och it
Artificiell intelligens inom Data och it

Fix-Point Equations for Well-Founded Recursion in Type Theory.- Programming and Computing in HOL.- Proof Terms for Simply Typed Higher Order Logic.- Routing Information Protocol in HOL/SPIN.- Recursive Families of Inductive Types.- Aircraft Trajectory Modeling and Alerting Algorithm Verification.- Intel’s Formal Verification Experience on the Willamette Development.- A Prototype Proof Translator from HOL to Coq.- Proving ML Type Soundness Within Coq.- On the Mechanization of Real Analysis in Isabelle/HOL.- Equational Reasoning via Partial Reflection.- Reachability Programming in HOL98 Using BDDs.- Transcendental Functions and Continuity Checking in PVS.- Verified Optimizations for the Intel IA-64 Architecture.- Formal Verification of IA-64 Division Algorithms.- Fast Tactic-Based Theorem Proving.- Implementing a Program Logic of Objects in a Higher-Order Logic Theorem Prover.- A Strong and Mechanizable Grand Logic.- Inheritance in Higher Order Logic: Modeling and Reasoning.- Total-Correctness Refinement for Sequential Reactive Systems.- Divider Circuit Verification with Model Checking and Theorem Proving.- Specification and Verification of a Steam-Boiler with Signal-Coq.- Functional Procedures in Higher-Order Logic.- Formalizing Stålmarck’s Algorithm in Coq.- TAS — A Generic Window Inference System.- Weak Alternating Automata in Isabelle/HOL.- Graphical Theories of Interactive Systems: Can a Proof Assistant Help?.- Formal Verification of the Alpha 21364 Network Protocol.- Dependently Typed Records for Representing Mathematical Structure.- Towards a Machine-Checked Java Specification Book.- Another Look at Nested Recursion.- Automating the Search for Answers to Open Questions.- Appendix: Conjectures Concerning Proof, Design, and Verification.