Verification of Parameterised FPGA Circuit Descriptions with Layout ...
Verification of Parameterised FPGA Circuit Descriptions with Layout ... Verification of Parameterised FPGA Circuit Descriptions with Layout ...
APPENDIX B. THEORETICAL BASIS FOR LAYOUT REASONING 202 lemma impdisj_3of4: "(A --> D) ==> (A --> (B|C|D|E))" by (auto) lemma impdisj_4of4: "(A --> E) ==> (A --> (B|C|D|E))" by (auto) lemma impdisj_1of2: "(A --> B) ==> (A --> (B|C))" by auto lemma impdisj_2of2: "(A --> C) ==> (A --> (B|C))" by auto lemma impdisj_12of4: "(A --> (B|C)) ==> (A --> (B|C|D|E))" by auto lemma impdisj_34of4: "(A --> (D|E)) ==> (A --> (B|C|D|E))" by auto section {* Zero size ranges *} lemma overlap0: "((0::int)
APPENDIX B. THEORETICAL BASIS FOR LAYOUT REASONING 203 ((m
- Page 161 and 162: CHAPTER 6. LAYOUT CASE STUDIES 151
- Page 163 and 164: CHAPTER 6. LAYOUT CASE STUDIES 153
- Page 165 and 166: CHAPTER 6. LAYOUT CASE STUDIES 155
- Page 167 and 168: CHAPTER 6. LAYOUT CASE STUDIES 157
- Page 169 and 170: CHAPTER 6. LAYOUT CASE STUDIES 159
- Page 171 and 172: CHAPTER 6. LAYOUT CASE STUDIES 161
- Page 173 and 174: CHAPTER 6. LAYOUT CASE STUDIES 163
- Page 175 and 176: CHAPTER 7. CONCLUSION AND FUTURE WO
- Page 177 and 178: CHAPTER 7. CONCLUSION AND FUTURE WO
- Page 179 and 180: CHAPTER 7. CONCLUSION AND FUTURE WO
- Page 181 and 182: CHAPTER 7. CONCLUSION AND FUTURE WO
- Page 183 and 184: CHAPTER 7. CONCLUSION AND FUTURE WO
- 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: APPENDIX B. THEORETICAL BASIS FOR L
- Page 203 and 204: APPENDIX B. THEORETICAL BASIS FOR L
- Page 205 and 206: APPENDIX B. THEORETICAL BASIS FOR L
- Page 207 and 208: APPENDIX B. THEORETICAL BASIS FOR L
- Page 209 and 210: APPENDIX B. THEORETICAL BASIS FOR L
- Page 211: APPENDIX B. THEORETICAL BASIS FOR L
- Page 215 and 216: APPENDIX B. THEORETICAL BASIS FOR L
- Page 217 and 218: Appendix C Placed Combinator Librar
- Page 219 and 220: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 221 and 222: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 223 and 224: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 225 and 226: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 227 and 228: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 229 and 230: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 231 and 232: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 233 and 234: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 235 and 236: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 237 and 238: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 239 and 240: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 241 and 242: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 243 and 244: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 245 and 246: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 247 and 248: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 249 and 250: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 251 and 252: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 253 and 254: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 255 and 256: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 257 and 258: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 259 and 260: APPENDIX C. PLACED COMBINATOR LIBRA
- Page 261 and 262: APPENDIX C. PLACED COMBINATOR LIBRA
APPENDIX B. THEORETICAL BASIS FOR LAYOUT REASONING 202<br />
lemma impdisj_3<strong>of</strong>4: "(A --> D) ==> (A --> (B|C|D|E))"<br />
by (auto)<br />
lemma impdisj_4<strong>of</strong>4: "(A --> E) ==> (A --> (B|C|D|E))"<br />
by (auto)<br />
lemma impdisj_1<strong>of</strong>2: "(A --> B) ==> (A --> (B|C))"<br />
by auto<br />
lemma impdisj_2<strong>of</strong>2: "(A --> C) ==> (A --> (B|C))"<br />
by auto<br />
lemma impdisj_12<strong>of</strong>4: "(A --> (B|C)) ==> (A --> (B|C|D|E))"<br />
by auto<br />
lemma impdisj_34<strong>of</strong>4: "(A --> (D|E)) ==> (A --> (B|C|D|E))"<br />
by auto<br />
section {* Zero size ranges *}<br />
lemma overlap0: "((0::int)