Obfuscation of Abstract Data-Types - Rowan

More documents

Recommendations

Info

APPENDIX A. LIST ASSERTION 145 = {definition of xs} |(t : ts) + ys| = {definition of +} |t : (ts + ys)| = {definition of | |} 1 + |ts + ys| = {induction hypothesis} 1 + |ts| + |ys| = {definition of | |} |t : ts| + |ys| = {definition of xs} |xs| + |ys| The tree is this proof is: (A.1) Base Step xs xs + + arith | | | | IH xs | | For this, C (A.1) = 11 and H (A.1) = 7. xs A.2 Alternating Split for Lists We want to prove that |xsp + asp ysp| asp = |xsp| asp + |ysp| asp (A.2) For the alternating split, we have two operations equivalent to +. A.2.1 Version 1 We first define: 〈l 0 ,r 0 〉 asp + asp 〈l 1 ,r 1 〉 asp = { 〈l0 + l 1 ,r 0 + r 1 〉 asp if |l 0 | = |r 0 | 〈l 0 + r 1 ,r 0 + l 1 〉 asp otherwise To prove (A.2), let xsp = 〈l 0 ,r 0 〉 asp and ysp = 〈l 1 ,r 1 〉 asp and we have two cases:
APPENDIX A. LIST ASSERTION 146 Case 1 Suppose that |l 0 | = |r 0 |. Then |xsp + asp ysp| asp = {definitions of xsp and ysp} |〈l 0 ,r 0 〉 asp + asp 〈l 1 ,r 1 〉 asp | asp = {definition of + asp } |〈l 0 + l 1 ,r 0 + r 1 〉 asp | asp = {definition of | | asp } |l 0 + l 1 | + |r 0 + r 1 | = {Equation (A.1)} |l 0 | + |l 1 | + |r 0 + r 1 | = {Equation (A.1)} |l 0 | + |l 1 | + |r 0 | + |r 1 | = {definition of | | asp } |〈l 0 ,r 0 〉 asp | asp + |l 1 | + |r 1 | = {definition of | | asp } |〈l 0 ,r 0 〉 asp | asp + |〈l 1 ,r 1 〉 asp | asp = {definitions of xsp and ysp} |xsp| asp + |ysp| asp Case 2 Suppose that |l 0 | ≠ |r 0 |. Then |xsp + asp ysp| asp = {definitions of xsp and ysp} |〈l 0 ,r 0 〉 asp + asp 〈l 1 ,r 1 〉 asp | asp = {definition of + asp } |〈l 0 + r 1 ,r 0 + l 1 〉 asp | asp = {definition of | | asp } |l 0 + r 1 | + |r 0 + l 1 | = {Equation (A.1)} |l 0 | + |r 1 | + |r 0 + l 1 | = {Equation (A.1)} |l 0 | + |r 1 | + |r 0 | + |l 1 | = {definition of | | asp } |〈l 0 ,r 0 〉 asp | asp + |l 1 | + |r 1 | = {definition for | | asp } |〈l 0 ,r 0 〉 asp | asp + |〈l 1 ,r 1 〉 asp | asp = {definitions of xsp and ysp} |xsp| asp + |ysp| asp
Page 1 and 2:
Obfuscation of Abstract Data-Types
Page 3 and 4:
Contents I The Current View of Obfu
Page 5 and 6:
5.4.3 Third Definition . . . . . .
Page 7 and 8:
List of Figures 1 An example of obf
Page 9 and 10:
8 public class c { d t1 = new d();
Page 11 and 12:
10 • Obfuscations can be proved c
Page 13 and 14:
Chapter 1 Obfuscation Scully: “No
Page 15 and 16:
CHAPTER 1. OBFUSCATION 14 These thr
Page 17 and 18:
CHAPTER 1. OBFUSCATION 16 by changi
Page 19 and 20:
CHAPTER 1. OBFUSCATION 18 We could
Page 21 and 22:
CHAPTER 1. OBFUSCATION 20 B 1 [0] =
Page 23 and 24:
Chapter 2 Obfuscations for Intermed
Page 25 and 26:
CHAPTER 2. OBFUSCATIONS FOR INTERME
Page 27 and 28:
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
Page 35 and 36:
Page 37 and 38:
Page 39 and 40:
Page 41 and 42:
Page 43 and 44:
Page 45 and 46:
Chapter 3 Techniques for Obfuscatio
Page 47 and 48:
CHAPTER 3. TECHNIQUES FOR OBFUSCATI
Page 49 and 50:
Page 51 and 52:
Page 53 and 54:
Page 55 and 56:
Page 57 and 58:
Page 59 and 60:
Page 61 and 62:
Page 63 and 64:
Part III Data-Type Case Studies 62
Page 65 and 66:
CHAPTER 4. SPLITTING HEADACHES 64 (
Page 67 and 68:
CHAPTER 4. SPLITTING HEADACHES 66 a
Page 69 and 70:
CHAPTER 4. SPLITTING HEADACHES 68 T
Page 71 and 72:
CHAPTER 4. SPLITTING HEADACHES 70 L
Page 73 and 74:
CHAPTER 4. SPLITTING HEADACHES 72 S
Page 75 and 76:
CHAPTER 4. SPLITTING HEADACHES 74 C
Page 77 and 78:
CHAPTER 4. SPLITTING HEADACHES 76 L
Page 79 and 80:
CHAPTER 4. SPLITTING HEADACHES 78 t
Page 81 and 82:
CHAPTER 4. SPLITTING HEADACHES 80 C
Page 83 and 84:
CHAPTER 4. SPLITTING HEADACHES 82 4
Page 85 and 86:
CHAPTER 4. SPLITTING HEADACHES 84 E
Page 87 and 88:
CHAPTER 4. SPLITTING HEADACHES 86 b
Page 89 and 90:
CHAPTER 4. SPLITTING HEADACHES 88 W
Page 91 and 92:
CHAPTER 4. SPLITTING HEADACHES 90 T
Page 93 and 94:
Chapter 5 Sets and the Splitting Bu
Page 95 and 96: CHAPTER 5. SETS AND THE SPLITTING 9
Page 109 and 110: CHAPTER 6. THE MATRIX OBFUSCATED 10
Page 121 and 122: CHAPTER 7. CULTIVATING TREE OBFUSCA
Page 135 and 136: Chapter 8 Conclusions and Further W
Page 137 and 138: CHAPTER 8. CONCLUSIONS AND FURTHER
Page 139 and 140: CHAPTER 8. CONCLUSIONS AND FURTHER
Page 141 and 142: BIBLIOGRAPHY 140 [13] Thomas H. Cor
Page 143 and 144: BIBLIOGRAPHY 142 [43] Simon Peyton
Page 145: Appendix A List assertion We want t
Page 149 and 150: APPENDIX A. LIST ASSERTION 148 For
Page 151 and 152: APPENDIX A. LIST ASSERTION 150 Case
Page 153 and 154: APPENDIX A. LIST ASSERTION 152 1 +
Page 155 and 156: APPENDIX A. LIST ASSERTION 154 0 +
Page 157 and 158: APPENDIX A. LIST ASSERTION 156 The
Page 159 and 160: APPENDIX A. LIST ASSERTION 158 The
Page 161 and 162: APPENDIX B. SET OPERATIONS 160 Now
Page 163 and 164: APPENDIX B. SET OPERATIONS 162 Proo
Page 165 and 166: APPENDIX B. SET OPERATIONS 164 B.2
Page 167 and 168: Appendix C Matrices We prove the as
Page 169 and 170: APPENDIX C. MATRICES 168 Base Case
Page 171 and 172: APPENDIX D. PROVING A TREE ASSERTIO
Page 187: APPENDIX E. OBFUSCATION EXAMPLE 186
show all

Obfuscation of Abstract Data-Types - Rowan

Create successful ePaper yourself

Delete template?

Save as template?