Theorem proving in higher order logics : 10th international conference, TPHOLs '97, Murray Hill, NJ, USA, August 19-22, 1997 : proceedings

This Book Constitutes The Refereed Proceedings Of The 10th International Conference On Theorem Proving In Higher Order Logics, Tphols '97, Held In Murray Hill, Nj, Usa, In August 1997. The Volume Presents 19 Carefully Revised Full Papers Selected From 32 Submissions During A Thorough Reviewing Process. The Papers Cover Work Related To All Aspects Of Theorem Proving In Higher Order Logics, Particularly Based On Secure Mechanization Of Those Logics; The Theorem Proving Systems Addressed Include Coq, Hol, Isabelle, Lego, And Pvs. An Isabelle-based Theorem Prover For Vdm-sl -- Executing Formal Specifications By Translation To Higher Order Logic Programming -- Human-style Theorem Proving Using Pvs -- A Hybrid Approach To Verifying Liveness In A Symmetric Multi-processor -- Formal Verification Of Concurrent Programs In Lp And In Coq: A Comparative Analysis -- Ml Programming In Constructive Type Theory -- Possibly Infinite Sequences In Theorem Provers: A Comparative Study -- Proof Normalization For A First-order Formulation Of Higher-order Logic -- Using A Pvs Embedding Of Csp To Verify Authentication Protocols -- Verifying The Accuracy Of Polynomial Approximations In Hol -- A Full Formalisation Of ?-calculus Theory In The Calculus Of Constructions -- Rewriting, Decision Procedures And Lemma Speculation For Automated Hardware Verification -- Refining Reactive Systems In Hol Using Action Systems -- On Formalization Of Bicategory Theory -- Towards An Object-oriented Progification Language -- Verification For Robust Specification -- A Theory Of Structured Model-based Specifications In Isabelle/hol -- Proof Presentation For Isabelle -- Derivation And Use Of Induction Schemes In Higher-order Logic -- Higher Order Quotients And Their Implementation In Isabelle Hol -- Type Classes And Overloading In Higher-order Logic -- A Comparative Study Of Coq And Hol. Elsa L. Gunter, Amy Felty, (eds.). Includes Bibliographical References And Index. An Isabelle-based theorem prover for VDM-SL....Pages 1-16 Executing formal specifications by translation to higher order logic programming....Pages 17-32 Human-style theorem proving using PVS....Pages 33-48 A hybrid approach to verifying liveness in a symmetric multi-processor....Pages 49-67 Formal verification of concurrent programs in L p and in C oq : A comparative analysis....Pages 69-85 ML programming in constructive type theory....Pages 87-87 Possibly infinite sequences in theorem provers: A comparative study....Pages 89-104 Proof normalization for a first-order formulation of higher-order logic....Pages 105-119 Using a PVS embedding of CSP to verify authentication protocols....Pages 121-136 Verifying the accuracy of polynomial approximations in HOL....Pages 137-152 A full formalisation of π-calculus theory in the calculus of constructions....Pages 153-169 Rewriting, decision procedures and lemma speculation for automated hardware verification....Pages 171-182 Refining reactive systems in HOL using action systems....Pages 183-197 On formalization of bicategory theory....Pages 199-214 Towards an object-oriented progification language....Pages 215-230 Verification for robust specification....Pages 231-241 A theory of structured model-based specifications in Isabelle/HOL....Pages 243-258 Proof presentation for Isabelle....Pages 259-274 Derivation and use of induction schemes in higher-order logic....Pages 275-290 Higher order quotients and their implementation in Isabelle HOL....Pages 291-306 Type classes and overloading in higher-order logic....Pages 307-322 A comparative study of Coq and HOL....Pages 323-337 This paper is about mechanizing proof support for VDM-SL, which is a formal notation for writing model-oriented specifications of software systems [13].