05197nam a22005535i 4500001001800000003000900018005001700027007001500044008004100059020001800100024003100118050001300149050002000162072001600182072001800198072002300216082001400239245020600253264006100459300003300520336002600553337002600579338003600605347002400641490005800665505181500723520141502538650002203953650002603975650005004001650001504051650002004066650002404086650002904110650002204139650004604161650002704207650005204234650004504286650003704331650002604368700002804394700002904422710003404451773002004485776003604505830005804541856004404599978-3-540-44659-0DE-He21320170515111518.0cr nn 008mamaa121227s2000 gw | s |||| 0|eng d a97835404465907 a10.1007/3-540-44659-12doi 4aQ334-342 4aTJ210.2-211.495 7aUYQ2bicssc 7aTJFM12bicssc 7aCOM0040002bisacsh04a006.322310aTheorem Proving in Higher Order Logicsh[electronic resource] :b13th International Conference, TPHOLs 2000 Portland, OR, USA, August 14–18, 2000 Proceedings /cedited by Mark Aagaard, John Harrison. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c2000. aIX, 539 p.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aLecture Notes in Computer Science,x0302-9743 ;v18690 aFix-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. aThis 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. 0aComputer science. 0aSoftware engineering. 0aProgramming languages (Electronic computers). 0aComputers. 0aComputer logic. 0aMathematical logic. 0aArtificial intelligence.14aComputer Science.24aArtificial Intelligence (incl. Robotics).24aTheory of Computation.24aProgramming Languages, Compilers, Interpreters.24aMathematical Logic and Formal Languages.24aLogics and Meanings of Programs.24aSoftware Engineering.1 aAagaard, Mark.eeditor.1 aHarrison, John.eeditor.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9783540678632 0aLecture Notes in Computer Science,x0302-9743 ;v186940uhttp://dx.doi.org/10.1007/3-540-44659-1