03765nam a22005535i 4500001001800000003000900018005001700027007001500044008004100059020001800100024002800118050001500146050001500161072001600176072002300192072002300215082001400238245020600252264006100458300003200519336002600551337002600577338003600603347002400639490005800663505134600721520053702067650002202604650001802626650002802644650002602672650001502698650002002713650002402733650002202757650003602779650002702815650004502842650001802887650002602905650003702931700002902968700002502997710003403022773002003056776003603076830005803112856004103170978-3-540-69526-4DE-He21320170515111448.0cr nn 008mamaa121227s1997 gw | s |||| 0|eng d a97835406952647 a10.1007/BFb00283812doi 4aQA76.9.A73 4aQA76.9.S88 7aUYD2bicssc 7aCOM0320002bisacsh 7aCOM0670002bisacsh04a003.322310aTheorem Proving in Higher Order Logicsh[electronic resource] :b10th International Conference, TPHOLs '97 Murray Hill, NJ, USA, August 19–22, 1997 Proceedings /cedited by Elsa L. Gunter, Amy Felty. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c1997. aX, 346 p.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aLecture Notes in Computer Science,x0302-9743 ;v12750 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. 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. 0aComputer science. 0aLogic design. 0aArchitecture, Computer. 0aSoftware engineering. 0aComputers. 0aComputer logic. 0aMathematical logic.14aComputer Science.24aComputer System Implementation.24aTheory of Computation.24aMathematical Logic and Formal Languages.24aLogic Design.24aSoftware Engineering.24aLogics and Meanings of Programs.1 aGunter, Elsa L.eeditor.1 aFelty, Amy.eeditor.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9783540633792 0aLecture Notes in Computer Science,x0302-9743 ;v127540uhttp://dx.doi.org/10.1007/BFb0028381