Computer verification of algorithms using a formal proof system:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Abschlussarbeit Buch |
Sprache: | English |
Veröffentlicht: |
Berlin
dissertation.de
2010
|
Ausgabe: | Als Ms. gedr. |
Schriftenreihe: | dissertation.de
1583 |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | 198 S. graph. Darst. 25 cm |
ISBN: | 9783866244832 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV036767696 | ||
003 | DE-604 | ||
005 | 20101130 | ||
007 | t | ||
008 | 101110s2010 gw d||| m||| 00||| eng d | ||
015 | |a 10,A35 |2 dnb | ||
016 | 7 | |a 1004229194 |2 DE-101 | |
020 | |a 9783866244832 |c kart. : EUR 53.00 |9 978-3-86624-483-2 | ||
035 | |a (OCoLC)682051864 | ||
035 | |a (DE-599)DNB1004229194 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
044 | |a gw |c XA-DE | ||
049 | |a DE-473 | ||
082 | 0 | |a 005.14 |2 22/ger | |
082 | 0 | |a 005.131 |2 22/ger | |
084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
084 | |a 004 |2 sdnb | ||
100 | 1 | |a Kaiser, Markus |e Verfasser |0 (DE-588)141940425 |4 aut | |
245 | 1 | 0 | |a Computer verification of algorithms using a formal proof system |c vorgelegt von Markus Kaiser |
250 | |a Als Ms. gedr. | ||
264 | 1 | |a Berlin |b dissertation.de |c 2010 | |
300 | |a 198 S. |b graph. Darst. |c 25 cm | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a dissertation.de |v 1583 | |
502 | |a Zugl.: Darmstadt, Techn. Univ., Diss., 2009 | ||
650 | 0 | 7 | |a Public-Key-Kryptosystem |0 (DE-588)4209133-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Formale Semantik |0 (DE-588)4122144-8 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Formale Spezifikationstechnik |0 (DE-588)4299725-2 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Beweissystem |0 (DE-588)4711800-3 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a HOL |0 (DE-588)4335765-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Verifikation |0 (DE-588)4135577-5 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Verifikation |0 (DE-588)4135577-5 |D s |
689 | 0 | 1 | |a Formale Spezifikationstechnik |0 (DE-588)4299725-2 |D s |
689 | 0 | 2 | |a HOL |0 (DE-588)4335765-9 |D s |
689 | 0 | 3 | |a Formale Semantik |0 (DE-588)4122144-8 |D s |
689 | 0 | 4 | |a Beweissystem |0 (DE-588)4711800-3 |D s |
689 | 0 | 5 | |a Public-Key-Kryptosystem |0 (DE-588)4209133-0 |D s |
689 | 0 | |5 DE-604 | |
830 | 0 | |a dissertation.de |v 1583 |w (DE-604)BV021464926 |9 1583 | |
856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020684609&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-020684609 |
Datensatz im Suchindex
_version_ | 1804143437593706496 |
---|---|
adam_text | CONTENTS LIST OF FIGURES 17 1 INTRODUCTION 19 2 CONTEXT 29 2.1
MATHEMATICAL LOGIC AND PROOF AUTOMATION 29 2.1.1 MOTIVATING EXAMPLES 29
2.1.2 LOGICAL VERIFICATION 31 2.1.3 AUTOMATED AND INTERACTIVE
VERIFICATION 32 2.2 HISTORY OF COMPUTER PROVING IN PREDICATE LOGIC 33
2.2.1 BOYER-MOORE FAMILY 33 2.2.2 HIGHER-ORDER LOGIC 34 2.3 THE MODEL 38
2.3.1 AIM OF COMPUTER PROVING 38 2.3.2 FORMAL VERIFICATION OF ALGORITHMS
39 2.3.3 A CRYPTOGRAPHIC CLIENT APPLICATION 40 2.3.4 CLIENT
IMPLEMENTATION/VERIFICATION 40 2.3.5 A DOMAIN OF EXPERTS 41 2.3.6
PROBLEM HANDLING 41 2.3.7 A KIND OF PROOF PATTERN 41 3 BACKGROUND 43 3.1
MATHEMATICAL BACKGROUND 43 3.1.1 INTRODUCTION TO CRYPTOGRAPHY 43 3.1.2
ASPECTS OF NUMBER THEORY 48 3.1.3 LOGIC AND CALCULI 51 3.2 OVERVIEW ON
TRAVERSAL ALGORITHMS 63 3.2.1 REWRITE RULES 64 3.2.2 ELEMENTARY
STRATEGIES/ BASIC COMBINATORE 64 3.2.3 AUXILIARY STRATEGIES 66 3.2.4
TRAVERSAL COMBINATORE 66 3.2.5 HIGHER-ORDER TRAVERSAL ALGORITHMS 67
3.2.6 A MOTIVATING EXAMPLE 67 3.3 FORMAL FRAMEWORK AND VERIFICATION IN
HOL 68 3.3.1 FORMAL FRAMEWORK 68 3.3.2 HOL AND FUNCTIONS 69 3.3.3
THEORIES 70 13 BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1004229194
DIGITALISIERT DURCH 14 CONTENTS 4 PRIMALITY IN PUBLIC-KEY CRYPTOGRAPHY
73 4.1 FORMAL PROBABILITY THEORY AND BAYES FORMULA 73 4.1.1 CLASSICAL
PROBABILITY THEORY 74 4.1.2 AXIOMATIC PROBABILITY THEORY 75 4.1.3
FUNDAMENTAL LEMMATA AND BAYES FORMULA 76 4.1.4 CRYPTOGRAPHIC
APPLICATION OF THE FORMAL FRAMEWORK . . . 77 4.1.5 APPLICATION OF FORMAL
PROBABILITY THEORY 79 4.1.6 A COMPLEXITY METRICS OF THE FORMAL MODEL 80
4.1.7 BIBLIOGRAPHIC CONCLUSION 80 4.2 FORMALIZED ASPECTS OF CRYPTOGRAPHY
80 4.2.1 OAEP 81 4.2.2 HASH FUNCTIONS 82 4.2.3 COMPLEXITY METRICS OF THE
FORMAL ASPECTS 86 4.3 MILLER-RABIN ALGORITHM 86 4.3.1 PRIMALITY OR
COMPOSITENESS 87 4.3.2 MILLER-RABIN ALGORITHM - OVERVIEW 89 4.3.3
MILLER-RABIN ALGORITHM - IMPLEMENTATION 89 4.3.4 MILLER-RABIN ALGORITHM
- CORRECTNESS 91 4.4 VERIFICATION OF MILLER-RABIN ALGORITHM 92 4.4.1
FORMALIZED MATHEMATICAL PROPERTIES 92 4.4.2 IMPLEMENTATION OF ALGORITHM
PRIM 93 4.4.3 IMPLEMENTATION OF ALGORITHM OPTIMIZEDPRIM 94 4.4.4
VERIFICATION OF ALGORITHM PRIM 96 4.4.5 VERIFICATION OF ALGORITHM
OPTIMIZEDPRIM 97 4.5 MILLER-RABIN ALGORITHM - CONCLUSION 99 5
VERIFICATION IN PUBLIC-KEY CRYPTOGRAPHY 101 5.1 RABIN PUBLIC-KEY SCHEME
101 5.1. CONTENTS 15 6 A FORMAL MODEL FOR TRAVERSAL ALGORITHMS 127 6.1
MOTIVATION 128 6.1.1 CONSTANT PROPAGATION 128 6.1.2 PARALLEL RENAMING
129 6.1.3 DEFINITION UNFOLDING 129 6.2 BACKGROUND 130 6.2.1
PRIMITIVES/COMBINATORS 130 6.2.2 A LIBRARY 132 6.3 BASIC FORMAL MODEL
132 6.3.1 THE TERMS THEORY 133 6.3.2 THE PRIMITIVES THEORY 133 6.4
RELATION TO OPERATIONAL RULES 136 6.4.1 BASIC TRANSLITERATION 136 6.4.2
INDEXED-BOUND TRANSLITERATION 136 6.5 ALGEBRAIC LAWS 137 6.5.1 LAWS FOR
SEQUENCE AND CHOICE 138 6.5.2 LAWS FOR ALL AND ONE 138 6.5.3 FUSION LAW
FOR ALL 139 7 VERIFICATION OF HIGHER-ORDER TRAVERSAL ALGORITHMS 141 7.1
MODELING PARTIAL STRATEGIES 141 7.1.1 FORMALIZING TRY 141 7.1.2 A
PROBLEM IN FORMALIZING REPEAT 142 7.1.3 OVERVIEW OF THE APPROACH 142
7.1.4 IDENTIFICATION OF TERMINATION CONDITIONS 143 7.1.5 A RELATIONAL
DEFINITION OF REPEAT 143 7.1.6 THE FUNCTIONAL PROPERTY OF A RELATION 143
7.1. 8 MODELING AND PROVING IN HOL * A DISCUSSION 161 8.1 FORMAL
VERIFICATION IN GENERAL 161 8.1.1 GENERAL OVERVIEW 161 8.1.2
VERIFICATION APPROACH 162 8.1.3 A KIND OF INTERFACE 163 8.1.4 MODELING
PARTIAL FUNCTIONS 163 8.1.5 IMPROVED PROVING 166 8.1.6 PROOF EXPERIENCE
166 8.2 ELLIPTIC CURVE CRYPTOGRAPHY 167 8.3 ALGEBRAIC TRAVERSAL
ALGORITHMS AND FUNCTIONS 168 9 CONCLUSION 171 9.1 REVIEW 171 9.2
LIMITATIONS 174 9.3 WORK FOR THE FUTURE 175 9.3.1 VERIFYING CRYPTOGRAPHY
175 9.3.2 TRAVERSAL ALGORITHMS AND FUNCTIONS 175 APPENDIX 179
BIBLIOGRAPHY 183 INDEX 195
|
any_adam_object | 1 |
author | Kaiser, Markus |
author_GND | (DE-588)141940425 |
author_facet | Kaiser, Markus |
author_role | aut |
author_sort | Kaiser, Markus |
author_variant | m k mk |
building | Verbundindex |
bvnumber | BV036767696 |
classification_rvk | ST 134 |
ctrlnum | (OCoLC)682051864 (DE-599)DNB1004229194 |
dewey-full | 005.14 005.131 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 005 - Computer programming, programs, data, security |
dewey-raw | 005.14 005.131 |
dewey-search | 005.14 005.131 |
dewey-sort | 15.14 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
edition | Als Ms. gedr. |
format | Thesis Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02272nam a2200565 cb4500</leader><controlfield tag="001">BV036767696</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20101130 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">101110s2010 gw d||| m||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">10,A35</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1004229194</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783866244832</subfield><subfield code="c">kart. : EUR 53.00</subfield><subfield code="9">978-3-86624-483-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)682051864</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1004229194</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.14</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.131</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kaiser, Markus</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)141940425</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computer verification of algorithms using a formal proof system</subfield><subfield code="c">vorgelegt von Markus Kaiser</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Als Ms. gedr.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">dissertation.de</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">198 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">25 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">dissertation.de</subfield><subfield code="v">1583</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Darmstadt, Techn. Univ., Diss., 2009</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Public-Key-Kryptosystem</subfield><subfield code="0">(DE-588)4209133-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Formale Semantik</subfield><subfield code="0">(DE-588)4122144-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Formale Spezifikationstechnik</subfield><subfield code="0">(DE-588)4299725-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Beweissystem</subfield><subfield code="0">(DE-588)4711800-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">HOL</subfield><subfield code="0">(DE-588)4335765-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verifikation</subfield><subfield code="0">(DE-588)4135577-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Verifikation</subfield><subfield code="0">(DE-588)4135577-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Formale Spezifikationstechnik</subfield><subfield code="0">(DE-588)4299725-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">HOL</subfield><subfield code="0">(DE-588)4335765-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Formale Semantik</subfield><subfield code="0">(DE-588)4122144-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Beweissystem</subfield><subfield code="0">(DE-588)4711800-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="5"><subfield code="a">Public-Key-Kryptosystem</subfield><subfield code="0">(DE-588)4209133-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">dissertation.de</subfield><subfield code="v">1583</subfield><subfield code="w">(DE-604)BV021464926</subfield><subfield code="9">1583</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020684609&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-020684609</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV036767696 |
illustrated | Illustrated |
indexdate | 2024-07-09T22:47:39Z |
institution | BVB |
isbn | 9783866244832 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-020684609 |
oclc_num | 682051864 |
open_access_boolean | |
owner | DE-473 DE-BY-UBG |
owner_facet | DE-473 DE-BY-UBG |
physical | 198 S. graph. Darst. 25 cm |
publishDate | 2010 |
publishDateSearch | 2010 |
publishDateSort | 2010 |
publisher | dissertation.de |
record_format | marc |
series | dissertation.de |
series2 | dissertation.de |
spelling | Kaiser, Markus Verfasser (DE-588)141940425 aut Computer verification of algorithms using a formal proof system vorgelegt von Markus Kaiser Als Ms. gedr. Berlin dissertation.de 2010 198 S. graph. Darst. 25 cm txt rdacontent n rdamedia nc rdacarrier dissertation.de 1583 Zugl.: Darmstadt, Techn. Univ., Diss., 2009 Public-Key-Kryptosystem (DE-588)4209133-0 gnd rswk-swf Formale Semantik (DE-588)4122144-8 gnd rswk-swf Formale Spezifikationstechnik (DE-588)4299725-2 gnd rswk-swf Beweissystem (DE-588)4711800-3 gnd rswk-swf HOL (DE-588)4335765-9 gnd rswk-swf Verifikation (DE-588)4135577-5 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Verifikation (DE-588)4135577-5 s Formale Spezifikationstechnik (DE-588)4299725-2 s HOL (DE-588)4335765-9 s Formale Semantik (DE-588)4122144-8 s Beweissystem (DE-588)4711800-3 s Public-Key-Kryptosystem (DE-588)4209133-0 s DE-604 dissertation.de 1583 (DE-604)BV021464926 1583 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020684609&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Kaiser, Markus Computer verification of algorithms using a formal proof system dissertation.de Public-Key-Kryptosystem (DE-588)4209133-0 gnd Formale Semantik (DE-588)4122144-8 gnd Formale Spezifikationstechnik (DE-588)4299725-2 gnd Beweissystem (DE-588)4711800-3 gnd HOL (DE-588)4335765-9 gnd Verifikation (DE-588)4135577-5 gnd |
subject_GND | (DE-588)4209133-0 (DE-588)4122144-8 (DE-588)4299725-2 (DE-588)4711800-3 (DE-588)4335765-9 (DE-588)4135577-5 (DE-588)4113937-9 |
title | Computer verification of algorithms using a formal proof system |
title_auth | Computer verification of algorithms using a formal proof system |
title_exact_search | Computer verification of algorithms using a formal proof system |
title_full | Computer verification of algorithms using a formal proof system vorgelegt von Markus Kaiser |
title_fullStr | Computer verification of algorithms using a formal proof system vorgelegt von Markus Kaiser |
title_full_unstemmed | Computer verification of algorithms using a formal proof system vorgelegt von Markus Kaiser |
title_short | Computer verification of algorithms using a formal proof system |
title_sort | computer verification of algorithms using a formal proof system |
topic | Public-Key-Kryptosystem (DE-588)4209133-0 gnd Formale Semantik (DE-588)4122144-8 gnd Formale Spezifikationstechnik (DE-588)4299725-2 gnd Beweissystem (DE-588)4711800-3 gnd HOL (DE-588)4335765-9 gnd Verifikation (DE-588)4135577-5 gnd |
topic_facet | Public-Key-Kryptosystem Formale Semantik Formale Spezifikationstechnik Beweissystem HOL Verifikation Hochschulschrift |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020684609&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV021464926 |
work_keys_str_mv | AT kaisermarkus computerverificationofalgorithmsusingaformalproofsystem |