000 | 03897nam a22006615i 4500 | ||
---|---|---|---|
001 | 978-3-540-48256-7 | ||
003 | DE-He213 | ||
005 | 20240423132450.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1999 gw | s |||| 0|eng d | ||
020 |
_a9783540482567 _9978-3-540-48256-7 |
||
024 | 7 |
_a10.1007/3-540-48256-3 _2doi |
|
050 | 4 | _aT57-57.97 | |
072 | 7 |
_aPBW _2bicssc |
|
072 | 7 |
_aMAT003000 _2bisacsh |
|
072 | 7 |
_aPBW _2thema |
|
082 | 0 | 4 |
_a519 _223 |
245 | 1 | 0 |
_aTheorem Proving in Higher Order Logics _h[electronic resource] : _b12th International Conference, TPHOLs'99, Nice, France, September 14-17, 1999, Proceedings / _cedited by Yves Bertot, Gilles Dowek, Andre Hirschowitz, Christine Paulin, Laurent Thery. |
250 | _a1st ed. 1999. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1999. |
|
300 |
_aVIII, 364 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 ; _v1690 |
|
505 | 0 | _aRecent Advancements in Hardware Verification — How to Make Theorem Proving Fit for an Industrial Usage -- Disjoint Sums over Type Classes in HOL -- Inductive Datatypes in HOL — Lessons Learned in Formal-Logic Engineering -- Isomorphisms — A Link Between the Shallow and the Deep -- Polytypic Proof Construction -- Recursive Function Definition over Coinductive Types -- Hardware Verification Using Co-induction in COQ -- Connecting Proof Checkers and Computer Algebra Using OpenMath -- A Machine-Checked Theory of Floating Point Arithmetic -- Universal Algebra in Type Theory -- Locales A Sectioning Concept for Isabelle -- Isar — A Generic Interpretative Approach to Readable Formal Proof Documents -- On the Implementation of an Extensible Declarative Proof Language -- Three Tactic Theorem Proving -- Mechanized Operational Semantics via (Co)Induction -- Representing WP Semantics in Isabelle/ZF -- A HOL Conversion for Translating Linear Time Temporal Logic to ?-Automata -- From I/O Automata to Timed I/O Automata -- Formal Methods and Security Evaluation -- Importing MDG Verification Results into HOL -- Integrating Gandalf and HOL -- Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving -- Symbolic Functional Evaluation. | |
650 | 0 | _aMathematics. | |
650 | 0 | _aComputer software. | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aSoftware engineering. | |
650 | 1 | 4 | _aApplications of Mathematics. |
650 | 2 | 4 | _aMathematical Software. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aArtificial Intelligence. |
650 | 2 | 4 | _aSoftware Engineering. |
700 | 1 |
_aBertot, Yves. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aDowek, Gilles. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aHirschowitz, Andre. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aPaulin, Christine. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aThery, Laurent. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540664635 |
776 | 0 | 8 |
_iPrinted edition: _z9783662183410 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1690 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-48256-3 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c188048 _d188048 |