Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000 Portland, OR, USA, August 14-18, 2000 Proceedings by Mark AagaardTheorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000 Portland, OR, USA, August 14-18, 2000 Proceedings by Mark Aagaard

Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000 Portland, OR…

EditorMark Aagaard

Paperback | July 27, 2000

Pricing and Purchase Info

$159.25 online 
$180.95 list price save 11%
Earn 796 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This volume is the proceedings of the 13th International Conference on Theo­ rem Proving in Higher Order Logics (TPHOLs 2000) held 14-18 August 2000 in Portland, Oregon, USA. Each of the 55 papers submitted in the full rese­ arch category was refereed by at least three reviewers who were selected by the program committee. Because of the limited space available in the program and proceedings, only 29 papers were accepted for presentation and publication in this volume. In keeping with tradition, TPHOLs 2000 also offered a venue for the presen­ tation of work in progress, where researchers invite discussion by means of a brief preliminary talk and then discuss their work at a poster session. A supplemen­ tary proceedings containing associated papers for work in progress was published by the Oregon Graduate Institute (OGI) as technical report CSE-00-009. The organizers are grateful to Bob Colwell, Robin Milner and Larry Wos for agreeing to give invited talks. Bob Colwell was the lead architect on the Intel P6 microarchitecture, which introduced a number of innovative techniques and achieved enormous commercial success. As such, he is ideally placed to offer an industrial perspective on the challenges for formal verification. Robin Milner contributed many key ideas to computer theorem proving, and to functional programming, through his leadership of the influential Edinburgh LCF project.
Title:Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000 Portland, OR…Format:PaperbackDimensions:548 pages, 9.17 × 6.1 × 0.68 inPublished:July 27, 2000Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540678638

ISBN - 13:9783540678632

Look for similar items by category:

Reviews

Table of Contents

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.