03965nam a22006255i 4500
978-3-540-69526-4
DE-He213
20170515111448.0
cr nn 008mamaa
121227s1997 gw | s |||| 0|eng d
9783540695264
978-3-540-69526-4
10.1007/BFb0028381
doi
QA76.9.A73
QA76.9.S88
UYD
bicssc
COM032000
bisacsh
COM067000
bisacsh
003.3
23
Theorem Proving in Higher Order Logics
[electronic resource] :
10th International Conference, TPHOLs '97 Murray Hill, NJ, USA, August 19–22, 1997 Proceedings /
edited by Elsa L. Gunter, Amy Felty.
Berlin, Heidelberg :
Springer Berlin Heidelberg,
1997.
X, 346 p.
online resource.
text
txt
rdacontent
computer
c
rdamedia
online resource
cr
rdacarrier
text file
PDF
rda
Lecture Notes in Computer Science,
0302-9743 ;
1275
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.
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.
Computer science.
Logic design.
Architecture, Computer.
Software engineering.
Computers.
Computer logic.
Mathematical logic.
Computer Science.
Computer System Implementation.
Theory of Computation.
Mathematical Logic and Formal Languages.
Logic Design.
Software Engineering.
Logics and Meanings of Programs.
Gunter, Elsa L.
editor.
Felty, Amy.
editor.
SpringerLink (Online service)
Springer eBooks
Printed edition:
9783540633792
Lecture Notes in Computer Science,
0302-9743 ;
1275
http://dx.doi.org/10.1007/BFb0028381
ZDB-2-SCS
ZDB-2-LNC
ZDB-2-BAE
ddc
EB
Computer Science (Springer-11645)
14354
14354