000 | 04104nam a22006255i 4500 | ||
---|---|---|---|
001 | 978-3-319-22102-1 | ||
003 | DE-He213 | ||
005 | 20240423125628.0 | ||
007 | cr nn 008mamaa | ||
008 | 150818s2015 sz | s |||| 0|eng d | ||
020 |
_a9783319221021 _9978-3-319-22102-1 |
||
024 | 7 |
_a10.1007/978-3-319-22102-1 _2doi |
|
050 | 4 | _aQA267-268.5 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a005.131 _223 |
245 | 1 | 0 |
_aInteractive Theorem Proving _h[electronic resource] : _b6th International Conference, ITP 2015, Nanjing, China, August 24-27, 2015, Proceedings / _cedited by Christian Urban, Xingyuan Zhang. |
250 | _a1st ed. 2015. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2015. |
|
300 |
_aXI, 469 p. 63 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v9236 |
|
505 | 0 | _aVerified, Practical Upper Bounds for State Space Diameters -- Formalization of Error-correcting Codes: from Hamming to Modern Coding Theory -- ROSCoq: Robots powered by Constructive Reals -- Asynchronous processing of Coq documents: from the kernel up to the user interface -- A Concrete Memory Model for CompCert -- Validating Dominator Trees for a Fast, Verified Dominance Test -- Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra -- Mechanisation of AKS Algorithm -- Machine-Checked Verification of the Correctness and Amortized -- Improved Tool Support for Machine-Code Decompilation in HOL4 -- A Formalized Hierarchy of Probabilistic System Types -- Learning To Parse on Aligned Corpora -- A Consistent Foundation for Isabelle/HOL -- Foundational Property-Based Testing -- A First-Order Functional Intermediate Language for Verified Compilers -- Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions -- ModuRes: a Coq Library for Modular Reasoning about Concurrent -- Higher-Order Imperative Programming Languages -- Transfinite Constructions in Classical Type Theory -- A Mechanized Theory of regular trees in dependent type theory -- Deriving Comparators and Show-Functions in Isabelle/HOL -- Formalizing Knot Theory in Isabelle/HOL -- Pattern Matches in HOL: A New Representation and Improved Code Generation. | |
520 | _aThis book constitutes the proceedings of the 6th International Conference on Interactive Theorem Proving, ITP 2015, held in Nanjing, China, in August 2015. The 27 papers presented in this volume were carefully reviewed and selected from 54 submissions. The topics range from theoretical foundations to implementation aspects and applications in program verification, security and formalization of mathematics. | ||
650 | 0 | _aMachine theory. | |
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aData protection. | |
650 | 0 | _aAlgorithms. | |
650 | 1 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aArtificial Intelligence. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aData and Information Security. |
650 | 2 | 4 | _aAlgorithms. |
700 | 1 |
_aUrban, Christian. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aZhang, Xingyuan. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783319221014 |
776 | 0 | 8 |
_iPrinted edition: _z9783319221038 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v9236 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-319-22102-1 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c180030 _d180030 |