03311nmm a2200409 u 4500001001200000003002700012005001700039007002400056008004100080020001800121100003000139245020200169250001700371260006300388300003000451505134600481653001701827653004401844653002501888653002301913653002701936653002501963653001401988653003502002653002602037653001702063653003602080653001902116700002502135710003402160041001902194989003802213490003802251856006502289082001002354520053702364EB000659572EBX0100000000000000051265400000000000000.0cr|||||||||||||||||||||140122 ||| eng a97835406952641 aGunter, Elsa L.e[editor]00aTheorem Proving in Higher Order LogicshElektronische Ressourceb10th International Conference, TPHOLs'97, Murray Hill, NJ, USA, August 19-22, 1997, Proceedingscedited by Elsa L. Gunter, Amy Felty a1st ed. 1997 aBerlin, HeidelbergbSpringer Berlin Heidelbergc1997, 1997 aX, 346 pbonline resource0 aAn 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. aLogic Design aMathematical Logic and Formal Languages aSoftware engineering aMathematical logic aArchitecture, Computer aSoftware Engineering aComputers aComputer System Implementation aTheory of Computation aLogic design aLogics and Meanings of Programs aComputer logic1 aFelty, Amye[editor]2 aSpringerLink (Online service)07aeng2ISO 639-2 bSBAaSpringer Book Archives -20040 aLecture Notes in Computer Science uhttps://doi.org/10.1007/BFb0028381?nosfx=yxVerlag3Volltext0 a003.3 aThis 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.