000 | 04141nam a22006255i 4500 | ||
---|---|---|---|
001 | 978-3-540-69526-4 | ||
003 | DE-He213 | ||
005 | 20240423132523.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1997 gw | s |||| 0|eng d | ||
020 |
_a9783540695264 _9978-3-540-69526-4 |
||
024 | 7 |
_a10.1007/BFb0028381 _2doi |
|
050 | 4 | _aQA76.9.S88 | |
072 | 7 |
_aUYD _2bicssc |
|
072 | 7 |
_aCOM011000 _2bisacsh |
|
072 | 7 |
_aUYD _2thema |
|
082 | 0 | 4 |
_a004.2 _223 |
245 | 1 | 0 |
_aTheorem Proving in Higher Order Logics _h[electronic resource] : _b10th International Conference, TPHOLs'97, Murray Hill, NJ, USA, August 19-22, 1997, Proceedings / _cedited by Elsa L. Gunter, Amy Felty. |
250 | _a1st ed. 1997. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1997. |
|
300 |
_aX, 346 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1275 |
|
505 | 0 | _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. | |
520 | _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. | ||
650 | 0 | _aComputer systems. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aLogic design. | |
650 | 0 | _aSoftware engineering. | |
650 | 1 | 4 | _aComputer System Implementation. |
650 | 2 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aLogic Design. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
700 | 1 |
_aGunter, Elsa L. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aFelty, Amy. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540633792 |
776 | 0 | 8 |
_iPrinted edition: _z9783662169339 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1275 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/BFb0028381 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c188653 _d188653 |