Cantitate/Preț
Produs

Theorem Proving in Higher Order Logics: 10th International Conference, TPHOLs'97, Murray Hill, NJ, USA, August 19-22, 1997, Proceedings: Lecture Notes in Computer Science, cartea 1275

Editat de Elsa L. Gunter, Amy Felty
en Limba Engleză Paperback – 6 aug 1997
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32275 lei

Preț vechi: 40344 lei
-20% Nou

Puncte Express: 484

Preț estimativ în valută:
6177 6516$ 5148£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540633792
ISBN-10: 3540633790
Pagini: 356
Ilustrații: X, 346 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.5 kg
Ediția:1997
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.