Verification of Parameterised FPGA Circuit Descriptions with Layout ...

More documents

Recommendations

Info

APPENDIX D. CIRCUIT LAYOUT CASE STUDIES 278 qs480>, a, b) ;;; and3 ;;; match)))) 0)))" apply (auto intro: sum_ge0 maxf_ge0 sum_ge0_frange maxf_ge0_frange sum_nsub1_plusf maxf_encloses and3.height_ge0 and3.width_ge0 simp add: and3_def) apply (simp add: maxf_lamx_top) done section {* Intersection theorems *} theorem "!! (n::int) (a::(wire)vector) (b::(wire)vector) (c::wire). [| match = bool2wire True ; ALL (j::int). ((0 ALL (j::int) (j’::int). ((0 int" width:: "int=>int=>((wire)vector*((wire)vector)vector)=>((wire)vector)vector=>int " insert:: "(int=>int=>((wire)vector*((wire)vector)vector)=>((wire)vector)vector=> bool, int=>int=>((wire)vector*((wire)vector)vector)=>((wire)vector)vector=> int)block" defs struct_def: "struct == % bits n (a, b) c. Def ((a, b) ;;; row $ (n, fork ;; [[ min2 $ bits, max2 $ bits ]]) ;; apr $ n ;;; c)" height_def: "height == % bits n (a, b) c. Height ((a, b) ;;; row $ (n, fork ;; [[ min2 $ bits, max2 $ bits ]]) ;; apr $ n ;;; c)"
APPENDIX D. CIRCUIT LAYOUT CASE STUDIES 279 width_def: "width == % bits n (a, b) c. Width ((a, b) ;;; row $ (n, fork ;; [[ min2 $ bits, max2 $ bits ]]) ;; apr $ n ;;; c)" insert_def: "insert == (| Def = struct, Height = height, Width = width |)" declare width_def [simp] declare height_def [simp] declare struct_def [simp] section {* Validity <strong>of</strong> width and height functions *} theorem height_ge0_int : "!! (bits::int) (n::int) (a::(wire)vector) (b::((wire)vector )vector) (c::((wire)vector)vector). 0
Page 1 and 2:
Imperial College of Science, Techno
Page 3 and 4:
Acknowledgements Firstly, I’d lik
Page 5 and 6:
TABLE OF CONTENTS iv 2.5 Isabelle:
Page 7 and 8:
TABLE OF CONTENTS vi 5.3.1 Speciali
Page 9 and 10:
TABLE OF CONTENTS viii C.1.1 fst .
Page 11 and 12:
Chapter 1 Introduction This thesis
Page 13 and 14:
CHAPTER 1. INTRODUCTION 3 B A C Fig
Page 15 and 16:
CHAPTER 1. INTRODUCTION 5 pler, all
Page 17 and 18:
CHAPTER 2. BACKGROUND AND RELATED W
Page 19 and 20:
Page 21 and 22:
Page 23 and 24:
Page 25 and 26:
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. GENERATING PARAMETERISED
Page 47 and 48:
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:
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
Page 73 and 74:
Page 75 and 76:
Chapter 4 Verifying Circuit Layouts
Page 77 and 78:
CHAPTER 4. VERIFYING CIRCUIT LAYOUT
Page 79 and 80:
Page 81 and 82:
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
Page 113 and 114:
Page 115 and 116:
Page 117 and 118:
Chapter 5 Specialisation In this ch
Page 119 and 120:
CHAPTER 5. SPECIALISATION 109 opera
Page 121 and 122:
CHAPTER 5. SPECIALISATION 111 // Ha
Page 123 and 124:
CHAPTER 5. SPECIALISATION 113 circu
Page 125 and 126:
CHAPTER 5. SPECIALISATION 115 const
Page 127 and 128:
CHAPTER 5. SPECIALISATION 117 block
Page 129 and 130:
CHAPTER 5. SPECIALISATION 119 Modif
Page 131 and 132:
CHAPTER 5. SPECIALISATION 121 Buffe
Page 133 and 134:
CHAPTER 5. SPECIALISATION 123 a fas
Page 135 and 136:
CHAPTER 5. SPECIALISATION 125 block
Page 137 and 138:
CHAPTER 5. SPECIALISATION 127 y y y
Page 139 and 140:
CHAPTER 5. SPECIALISATION 129 with
Page 141 and 142:
CHAPTER 6. LAYOUT CASE STUDIES 131
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Page 151 and 152:
Page 153 and 154:
Page 155 and 156:
Page 157 and 158:
Page 159 and 160:
Page 161 and 162:
Page 163 and 164:
Page 165 and 166:
Page 167 and 168:
Page 169 and 170:
Page 171 and 172:
Page 173 and 174:
Page 175 and 176:
CHAPTER 7. CONCLUSION AND FUTURE WO
Page 177 and 178:
Page 179 and 180:
Page 181 and 182:
Page 183 and 184:
Page 185 and 186:
Bibliography [1] A. Aggoun and N. B
Page 187 and 188:
BIBLIOGRAPHY 177 [19] H. Gelernter.
Page 189 and 190:
BIBLIOGRAPHY 179 [41] Y. Li and M.
Page 191 and 192:
BIBLIOGRAPHY 181 [60] L. C. Paulson
Page 193 and 194:
BIBLIOGRAPHY 183 [83] J. Voeten. On
Page 195 and 196:
APPENDIX A. QUARTZ LANGUAGE GRAMMAR
Page 197 and 198:
Appendix B Theoretical Basis for La
Page 199 and 200:
APPENDIX B. THEORETICAL BASIS FOR L
Page 201 and 202:
Page 203 and 204:
Page 205 and 206:
Page 207 and 208:
Page 209 and 210:
Page 211 and 212:
Page 213 and 214:
Page 215 and 216:
Page 217 and 218:
Appendix C Placed Combinator Librar
Page 219 and 220:
APPENDIX C. PLACED COMBINATOR LIBRA
Page 221 and 222:
Page 223 and 224:
Page 225 and 226:
Page 227 and 228:
Page 229 and 230:
Page 231 and 232:
Page 233 and 234:
Page 235 and 236:
Page 237 and 238: APPENDIX C. PLACED COMBINATOR LIBRA
Page 279 and 280: APPENDIX D. CIRCUIT LAYOUT CASE STU
Page 287: APPENDIX D. CIRCUIT LAYOUT CASE STU
Page 327: APPENDIX D. CIRCUIT LAYOUT CASE STU
show all

Verification of Parameterised FPGA Circuit Descriptions with Layout ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?