Algorithms for the efficient verification and planning of information technology change operations:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
2013
|
| Schlagworte: | |
| Online-Zugang: | Volltext https://nbn-resolving.org/urn:nbn:de:bvb:91-diss-20130605-1128856-0-7 Inhaltsverzeichnis |
| Beschreibung: | IV, 196 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV041197133 | ||
| 003 | DE-604 | ||
| 005 | 20131218 | ||
| 007 | t | ||
| 008 | 130731s2013 d||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)856866006 | ||
| 035 | |a (DE-599)BVBBV041197133 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 |a DE-12 |a DE-91G | ||
| 082 | 0 | |a 004 | |
| 084 | |a DAT 325d |2 stub | ||
| 084 | |a DAT 345d |2 stub | ||
| 084 | |a DAT 060d |2 stub | ||
| 100 | 1 | |a Hagen, Sebastian |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithms for the efficient verification and planning of information technology change operations |c Sebastian Hagen |
| 264 | 1 | |c 2013 | |
| 300 | |a IV, 196 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a München, Techn. Univ., Diss., 2013 | ||
| 650 | 0 | 7 | |a Verifikation |0 (DE-588)4135577-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Change Management |0 (DE-588)7606306-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informationstechnik |0 (DE-588)4026926-7 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Informationstechnik |0 (DE-588)4026926-7 |D s |
| 689 | 0 | 1 | |a Change Management |0 (DE-588)7606306-9 |D s |
| 689 | 0 | 2 | |a Verifikation |0 (DE-588)4135577-5 |D s |
| 689 | 0 | 3 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |o urn:nbn:de:bvb:91-diss-20130605-1128856-0-7 |
| 856 | 4 | 1 | |u http://mediatum.ub.tum.de/node?id=1128856 |x Verlag |z kostenfrei |3 Volltext |
| 856 | 4 | |u https://nbn-resolving.org/urn:nbn:de:bvb:91-diss-20130605-1128856-0-7 |x Resolving-System | |
| 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=026172088&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-026172088 | ||
Datensatz im Suchindex
| _version_ | 1804150621518954496 |
|---|---|
| adam_text | CONTENTS
1 INTRODUCTION 1
1.1 MOTIVATION 1
1.2 PROBLEM STATEMENT . . . 2
1.3 CONTRIBUTIONS 3
1.4 NOMENCLATURE 5
1.5 OUTLINE 6
2 EXTENDED PARTIAL-ORDER REDUCTION OF GLOBAL FORMULAS 9
2.1 VERIFICATION PROBLEM AND DEFINITIONS 9
2.2 MOTIVATION AND RELATED WORK: PARTIAL-ORDER REDUCTION 10
2.2.1 PARTIAL-ORDER REDUCTION VS. EXTENDED PARTIAL-ORDER REDUCTION 10
2.2.2 INTRODUCTION TO EXTENDED PARTIAL-ORDER REDUCTION 13
2.3 RELATIONSHIPS BETWEEN EFFECTS AND FORMULAS 15
2.3.1 POSITIVELY-PRESERVING (PP) EFFECTS 15
2.3.2 NEGATIVELY-PRESERVING (NP) EFFECTS 17
2.3.3 NEUTRALS, SUPPORTS, THREATS, AND AMBIGUOUS EFFECTS 18
2.3.4 RELATIONSHIPS AMONG EFFECTS 19
2.4 SINGLE EFFECTS IN SEQUENCES OF EFFECTS 20
2.4.1 THREAT-INDEPENDENT SUPPORTS 20
2.4.2 THREAT-INDEPENDENT AND PERMUTABLE THREATS 21
2.4.3 EFFECT-INDEPENDENT NEUTRALS 22
2.5 A CRITERION FOR ALWAYS-SATISFIABILITY OF FORMULAS 22
2.5.1 ALWAYS-SATISFIABILITY OF FORMULAS 22
2.5.2 INFLUENCE OF EFFECTS ON ALWAYS-SATISFIABILITY 24
2.5.3 AN ALWAYS-SATISFIABILITY CRITERION FOR FORMULAS 26
2.6 AN EFFICIENT CRITERION FOR ALWAYS-SATISFIABILITY OF COMPOUND
FORMULAS 27
2.7 CONCLUSIONS 29
HTTP://D-NB.INFO/1044276207
II
CONTENTS
3 A MANY-SORTED LOGIC FOR THE EFFICIENT VERIFICATION OF IT CHANGE
OPERATIONS 31
3.1 A MANY-SORTED LOGIC FOR IT CHANGE VERIFICATION 31
3.1.1 SYNTAX 31
3.1.2 SEMANTICS 32
3.2 CHANGE ACTIVITIES, SAFETY CONSTRAINTS, AND IT CHANGE VERIFICATION
PROBLEMS . . 34
3.2.1 IT CHANGES AND SAFETY CONSTRAINTS 34
3.2.2 VERIFICATION PROBLEMS FOR IT CHANGE MANAGEMENT . . 34
3.3 EFFECTS AND PREDICATES OF CHANGE VERIFICATION LOGIC 35
3.3.1 PREDICATES 35
3.3.2 EFFECTS 37
3.4 COMPLIANCE OF CHANGE VERIFICATION LOGIC WITH EXTENDED PARTIAL-ORDER
REDUCTION 38
3.4.1 RELATIONSHIPS BETWEEN EFFECTS AND PREDICATES 39
3.4.2 PREDICATES HAVE NO AMBIGUOUS EFFECTS 39
3.4.3 SUPPORTS OF PREDICATES ARE THREAT-INDEPENDENT 40
3.4.4 THREATS OF PREDICATES ARE PERMUTABLE 41
3.4.5 NEUTRALS OF PREDICATES ARE EFFECT-INDEPENDENT 42
4 ALGORITHMS FOR IT CHANGE VERIFICATION 43
4.1 AN EFFICIENT ALGORITHM TO COMPUTE ALWAYS-SATISFIABILITY OF
PREDICATES 43
4.1.1 STEPS TO DETERMINE ALWAYS-SATISFIABILITY 43
4.1.2 FUNCTIONS AND COMPLEXITIES TO COMPUTE ALWAYS-SATISFIABILITY OF
PREDI-,
CATES 45
4.1.3 REQUIREMENTS FOR LINEAR RUNTIME COMPLEXITY 49
4.2 ALGORITHMS FOR CHANGE VERIFICATION PROBLEMS 50
4.2.1 IT CHANGE VERIFICATION PROBLEM 50
4.2.2 IT CHANGE CONFLICT DETECTION PROBLEM 51
4.2.3 IT CHANGE VERIFICATION AND CONFLICT DETECTION PROBLEM 51
4.3 CONCLUSIONS 52
5 IT CHANGE VERIFICATION IN PRACTICE 55
5.1 AMAZON DATA CENTER OUTAGE 55
5.1.1 HOW A SIMPLE CHANGE ACTIVITY BROUGHT DOWN A CLOUD SERVICE .... 55
5.1.2 NETWORK OVERLOAD IN STATIC ROUTING ENVIRONMENTS 57
5.1.3 NETWORK OVERLOAD IN DYNAMIC ROUTING ENVIRONMENT 62
5.2 MODEL CHECKERS AND OPTIMIZATION STRATEGIES- 65
5.2.1 NUSMV MODEL CHECKER 66
5.2.2 SPIN MODEL CHECKER 66
5.2.3 SPECIAL PURPOSE MODEL CHECKER 68
5.3 EXPERIMENTAL SETUP 68
5.3.1 FACTORS OF INFLUENCE ON THE VERIFICATION PERFORMANCE 68
5.3.2 MODELS AND SAFETY CONSTRAINTS 69
5.4 EXPERIMENTAL EVALUATION 81
5.4.1 BENCHMARKS 81
5.4.2 RUNTIME COMPLEXITY AND PERFORMANCE 83
5.4.3 MAXIMUM SOLVABLE PROBLEM INSTANCES IN TIME- AND MEMORY-CONS
TRAINED ENVIRONMENTS 90
5.4.4 ROBUSTNESS OF RUNTIME PERFORMANCE 92
5.4.5 WORST- AND BEST-CASE PERFORMANCE 94
CONTENTS III
5.5 RELATED WORK 95
5.5.1 IT CHANGE VERIFICATION 95
5.5.2 SECURITY RELATED CONFLICT DETECTION 95
5.5.3 CONFLICT DETECTION FOR SYSTEMS MANAGEMENT POLICIES 96
5.5.4 IMPROVING RELIABILITY OF SYSTEMS AND CHANGE MANAGEMENT 97
5.6 SUMMARY AND CONCLUSIONS 98
6 A COMPARISON OF AUTOMATED PLANNERS FOR IT CHANGE PLANNING 101
6.1 AUTOMATED PLANNING AND CASE STUDY 102
6.1.1 AUTOMATED PLANNING 102
6.-1.2 PLANNING CASE STUDY 105
6.2 PLANNING THROUGH PLANNING GRAPHS 107
6.2.1 THE GRAPHLAN ALGORITHM 107
6.2.2 EVALUATION 107
6.3 PLANNING THROUGH FORWARD CHAINING AND TEMPORAL CONTROL KNOWLEDGE
.... 109
6.3.1 THE TLPLAN ALGORITHM 109
6.3.2 EVALUATION 109
6.4 PLANNING THROUGH MEANS-END ANALYSIS ILL
6.4.1 THE PRODIGY ALGORITHM ILL
6.4.2 EVALUATION ILL
6.5 HIERARCHICAL TASK NETWORK PLANNING (HTN) 113
6.5.1 THE SHOP2 ALGORITHM 113
6.5.2 EVALUATION 114
6.6 RELATED WORK 116
6.7 CONCLUSIONS 117
7 EFFICIENT GENERATION OF IT CHANGE PLANS ON LARGE INFRASTRUCTURES 119
7.1 RELATED WORK AND CONTRIBUTIONS 120
7.2 HIERARCHICAL TASK NETWORK PLANNING (HTN) 122
7.2.1 INTRODUCTION TO HTN PLANNING 122
7.2.2 PLANNING ALGORITHM 122
7.2.3 UNIFICATION VS. OBJECT-ORIENTED PLANNING 124
7.3 SENSITIVITY AND ROBUSTNESS ANALYSIS 125
7.3.1 DESIGN OF MICROBENCHMARKS 125
7.3.2 PARAMETERS OF SENSITIVITY ANALYSIS 126
7.3.3 INFLUENCE OF COMPLEXITY OF PRECONDITIONS 127
7.3.4 INFLUENCE OF BACKTRACKING 130
7.3.5 INFLUENCE OF COMPLEXITY OF EFFECTS 132
7.4 CHANGE PLANNING CASE STUDIES 133
7.4.1 DEPLOYMENT OF A THREE-TIER APPLICATION 134
7.4.2 VIRTUAL NETWORK (UN)CONFIGURATION CASE STUDY 136
7.5 CONCLUSIONS 139
8 CONCLUSIONS AND FUTURE WORK 141
IV
CONTENTS
A. VERIFICATION THEORY 145
A.L PROOF OF PROPOSITION 2 145
A.2 PROOF OF PROPOSITION 3 147
A.3 PROOF OF PROPOSITION 4 148
A.4 PROOF OF PROPOSITION 11 149
B VERIFICATION BENCHMARKS 159
B. 1 VERIFICATION TIME DEPENDING ON MODEL, CMDB SIZE, AND CHANGE
WORKLOAD . . 159
B.L.L MODEL
1 159
B.1.2 MODEL 2 161
B.1.3 MODEL 3 162
B.1.4 MODEL 4 163
B.1.5 MODEL 5 165
B.1.6 MODEL 6 166
B.1.7 MODEL 7 167
B.1.8 MODEL 8 168
B.2 ROBUSTNESS OF VERIFICATION PERFORMANCE 169
B.3 BEST- VS. WORST-CASE VERIFICATION PERFORMANCE 170
C VERIFICATION MODELS 173
D PLANNING BENCHMARKS AND MICROBENCHMARKS 177
BIBLIOGRAPHY 187
|
| any_adam_object | 1 |
| author | Hagen, Sebastian |
| author_facet | Hagen, Sebastian |
| author_role | aut |
| author_sort | Hagen, Sebastian |
| author_variant | s h sh |
| building | Verbundindex |
| bvnumber | BV041197133 |
| classification_tum | DAT 325d DAT 345d DAT 060d |
| collection | ebook |
| ctrlnum | (OCoLC)856866006 (DE-599)BVBBV041197133 |
| dewey-full | 004 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004 |
| dewey-search | 004 |
| dewey-sort | 14 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02003nam a2200481 c 4500</leader><controlfield tag="001">BV041197133</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20131218 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">130731s2013 d||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)856866006</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV041197133</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 325d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 345d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 060d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hagen, Sebastian</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms for the efficient verification and planning of information technology change operations</subfield><subfield code="c">Sebastian Hagen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IV, 196 S.</subfield><subfield code="b">graph. Darst.</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="502" ind1=" " ind2=" "><subfield code="a">München, Techn. Univ., Diss., 2013</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="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Change Management</subfield><subfield code="0">(DE-588)7606306-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informationstechnik</subfield><subfield code="0">(DE-588)4026926-7</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">Informationstechnik</subfield><subfield code="0">(DE-588)4026926-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Change Management</subfield><subfield code="0">(DE-588)7606306-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><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="3"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="o">urn:nbn:de:bvb:91-diss-20130605-1128856-0-7</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://mediatum.ub.tum.de/node?id=1128856</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">https://nbn-resolving.org/urn:nbn:de:bvb:91-diss-20130605-1128856-0-7</subfield><subfield code="x">Resolving-System</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=026172088&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-026172088</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV041197133 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T00:41:50Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-026172088 |
| oclc_num | 856866006 |
| open_access_boolean | 1 |
| owner | DE-91 DE-BY-TUM DE-12 DE-91G DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM DE-12 DE-91G DE-BY-TUM |
| physical | IV, 196 S. graph. Darst. |
| psigel | ebook |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| record_format | marc |
| spelling | Hagen, Sebastian Verfasser aut Algorithms for the efficient verification and planning of information technology change operations Sebastian Hagen 2013 IV, 196 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier München, Techn. Univ., Diss., 2013 Verifikation (DE-588)4135577-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Change Management (DE-588)7606306-9 gnd rswk-swf Informationstechnik (DE-588)4026926-7 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Informationstechnik (DE-588)4026926-7 s Change Management (DE-588)7606306-9 s Verifikation (DE-588)4135577-5 s Algorithmus (DE-588)4001183-5 s DE-604 Erscheint auch als Online-Ausgabe urn:nbn:de:bvb:91-diss-20130605-1128856-0-7 http://mediatum.ub.tum.de/node?id=1128856 Verlag kostenfrei Volltext https://nbn-resolving.org/urn:nbn:de:bvb:91-diss-20130605-1128856-0-7 Resolving-System DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026172088&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Hagen, Sebastian Algorithms for the efficient verification and planning of information technology change operations Verifikation (DE-588)4135577-5 gnd Algorithmus (DE-588)4001183-5 gnd Change Management (DE-588)7606306-9 gnd Informationstechnik (DE-588)4026926-7 gnd |
| subject_GND | (DE-588)4135577-5 (DE-588)4001183-5 (DE-588)7606306-9 (DE-588)4026926-7 (DE-588)4113937-9 |
| title | Algorithms for the efficient verification and planning of information technology change operations |
| title_auth | Algorithms for the efficient verification and planning of information technology change operations |
| title_exact_search | Algorithms for the efficient verification and planning of information technology change operations |
| title_full | Algorithms for the efficient verification and planning of information technology change operations Sebastian Hagen |
| title_fullStr | Algorithms for the efficient verification and planning of information technology change operations Sebastian Hagen |
| title_full_unstemmed | Algorithms for the efficient verification and planning of information technology change operations Sebastian Hagen |
| title_short | Algorithms for the efficient verification and planning of information technology change operations |
| title_sort | algorithms for the efficient verification and planning of information technology change operations |
| topic | Verifikation (DE-588)4135577-5 gnd Algorithmus (DE-588)4001183-5 gnd Change Management (DE-588)7606306-9 gnd Informationstechnik (DE-588)4026926-7 gnd |
| topic_facet | Verifikation Algorithmus Change Management Informationstechnik Hochschulschrift |
| url | http://mediatum.ub.tum.de/node?id=1128856 https://nbn-resolving.org/urn:nbn:de:bvb:91-diss-20130605-1128856-0-7 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026172088&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT hagensebastian algorithmsfortheefficientverificationandplanningofinformationtechnologychangeoperations |