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

Полное описание

Сохранить в:
Библиографические подробности
Соавтор: International conference on theorem proving in higher order logics :Murray Hill, N.J.
Другие авторы: Gunter, Elsa L., 19..- (Публикующий директор), Felty, Amy P. (Публикующий директор)
Формат: Livre numérique
Язык:Anglais
Опубликовано: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Серии:Lecture notes in computer science 1275
Предметы:
Online-ссылка:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Примечание: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Theorem proving in higher order logics, 10th International Conference, TPHOLs '97, Murray Hill, NJ, USA, August 19-22, 1997, proceedings, Elsa L. Gunter, Amy Felty, eds, 1997, Berlin, Springer, 1 vol. (VIII-337 p.), Lecture notes in computer science, 3-540-63379-0
• Theorem Proving in Higher Order Logics, Texte imprimé, 9783662169339
Оглавление:
  • 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.