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...

Full description

Corporate Author: SpringerLink (Online service)
Other Authors: Gunter, Elsa L. (Editor), Felty, Amy (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1997, 1997
Edition:1st ed. 1997
Series:Lecture Notes in Computer Science
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 03326nmm a2200421 u 4500
001 EB000659572
003 EBX01000000000000000512654
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9783540695264 
100 1 |a Gunter, Elsa L.  |e [editor] 
245 0 0 |a Theorem Proving in Higher Order Logics  |h Elektronische Ressource  |b 10th International Conference, TPHOLs'97, Murray Hill, NJ, USA, August 19-22, 1997, Proceedings  |c edited by Elsa L. Gunter, Amy Felty 
250 |a 1st ed. 1997 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 1997, 1997 
300 |a X, 346 p  |b online resource 
505 0 |a 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. 
653 |a Logic Design 
653 |a Mathematical Logic and Formal Languages 
653 |a Software engineering 
653 |a Mathematical logic 
653 |a Architecture, Computer 
653 |a Software Engineering 
653 |a Computers 
653 |a Computer System Implementation 
653 |a Theory of Computation 
653 |a Logic design 
653 |a Logics and Meanings of Programs 
653 |a Computer logic 
700 1 |a Felty, Amy  |e [editor] 
710 2 |a SpringerLink (Online service) 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Computer Science 
856 |u https://doi.org/10.1007/BFb0028381?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 003.3 
520 |a 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.