Verification of Parameterised FPGA Circuit Descriptions with Layout ...

More documents

Recommendations

Info

BIBLIOGRAPHY 180 [50] S. McKeever, W. Luk, and A. Derbyshire. Towards verifying parametrised hardware li- braries with relative placement information. In Proc. HICSS ’03: 36th Hawaii Intl. Conf. on System Sciences, page 10, Washington, DC, USA, 2003. IEEE Computer Society. [51] W. M. Meleis, M. Leeser, P. Zavracky, and M. M. Vai. Architectural design of a three dimensional FPGA. In Proc. 17th Conf. Advanced Research in VLSI (ARVLSI), pages 256–268, September 1997. [52] T. Melham. Higher Order Logic and Hardware Verification. Cambridge Tracts in The- oretical Computer Science. Cambridge University Press, 1993. [53] R. Milner. A theory of type polymorphism in programming. J. Comput. Syst. Sci., 17:348–375, 1978. [54] A. Mycroft and R. Sharp. Higher-level techniques for hardware description and synthesis. International Journal on Software tools for Technology Transfer, 4(3):271–297, May 2003. [55] T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL: A Proof Assistant for Higher- Order Logic, volume 2283 of LNCS. Springer-Verlag, 2002. [56] S.-W. Ong, N. Kerkiz, B. Srijanto, C. Tan, M. Langston, D. Newport, and D. Bouldin. Automatic mapping of multiple applications to multiple adaptive computing systems. In Proc. FCCM’01: Proc. 9th IEEE Symp. Field-Programmable Custom Computing Machines, pages 10–20. IEEE, 2001. [57] J. Ou and V. K. Prasanna. Parameterized and energy efficient adaptive beamforming on FPGAs using MATLAB/Simulink. In Proc. ICASSP’04: IEEE Intl. Conf. Acoustics, Speech, and Signal Processing, volume 5, pages 181–184, 2004. [58] J. Ou and V. K. Prasanna. Pygen: a MATLAB/Simulink based tool for synthesizing parameterized and energy efficient designs using FPGAs. In Proc. FCCM 2004: 12th IEEE Symp. Field-Programmable Custom Computing Machines, pages 47–56. IEEE, April 2004. [59] S. Owre, J. M. Rushby, and N. Shankar. PVS: A prototype verification system. In D. Kapur, editor, 11th Intl. Conf. on Automated Deduction (CADE), volume 607 of LNAI, pages 748–752, Saratoga, NY, June 1992. Springer-Verlag.
BIBLIOGRAPHY 181 [60] L. C. Paulson. The foundation of a generic theorem prover. J. Automated Reasoning, 5:363–397, 1989. [61] L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of LNCS. Springer- Verlag, 1994. [62] O. Pell. Quartz: A new language for hardware description. Final Year Project Report, Dept of Computing, Imperial College, June 2004. [63] O. Pell. Quartz compilation algorithms. ISO Dissertation, Dept of Computing, Imperial College, January 2005. [64] O. Pell and W. Luk. Resolving Quartz overloading. In D. Borrione and W. Paul, edi- tors, Proc. CHARME’05: 13th Conference on Correct Hardware Design and Verification Methods, volume 3725 of LNCS, pages 380–383. Springer-Verlag, 2005. [65] O. Pell and W. Luk. Quartz: A framework for correct and efficient reconfigurable design. In Proc. RECONFIG’05: Intl. Conf. on Reconfigurable Computing and FPGAs. IEEE Computer Society Press, September 2005, to appear. [66] O. Pell and H. Yu. User’s tutorial for Pebble 5.0. https://cc.doc.ic.ac.uk/local/ pebble/doc/users/. [67] F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer- Verlag, 1985. [68] O. Rasmussen. Transformational VLSI Design. PhD thesis, Technical University of Denmark, 1997. [69] T. Riesgo, Y. Torroja, and E. de la Torre. Design methodologies based on hardware description languages. IEEE Trans. Industrial Electronics, 46(1):3–12, February 1999. [70] J. A. Robinson. A machine-oriented logic based on the resolution principle. J. ACM, 12(1):23–41, 1965. [71] P. Rudnicki. An overview of the Mizar project. In Proc. 1992 Workshop on Types for Proofs and Programs, Chalmers University of Technology, Bastad, 1992.
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 175 and 176: 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: BIBLIOGRAPHY 179 [41] Y. Li and M.
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 217 and 218: Appendix C Placed Combinator Librar
Page 219 and 220: APPENDIX C. PLACED COMBINATOR LIBRA
Page 241 and 242:
APPENDIX C. PLACED COMBINATOR LIBRA
Page 243 and 244:
Page 245 and 246:
Page 247 and 248:
Page 249 and 250:
Page 251 and 252:
Page 253 and 254:
Page 255 and 256:
Page 257 and 258:
Page 259 and 260:
Page 261 and 262:
Page 263 and 264:
Page 265 and 266:
Page 267 and 268:
Page 269 and 270:
Page 271 and 272:
Page 273 and 274:
Page 275 and 276:
Page 277 and 278:
Page 279 and 280:
APPENDIX D. CIRCUIT LAYOUT CASE STU
Page 281 and 282:
Page 283 and 284:
Page 285 and 286:
Page 287 and 288:
Page 289 and 290:
Page 291 and 292:
Page 293 and 294:
Page 295 and 296:
Page 297 and 298:
Page 299 and 300:
Page 301 and 302:
Page 303 and 304:
Page 305 and 306:
Page 307 and 308:
Page 309 and 310:
Page 311 and 312:
Page 313 and 314:
Page 315 and 316:
Page 317 and 318:
Page 319 and 320:
Page 321 and 322:
Page 323 and 324:
Page 325 and 326:
Page 327:
show all

Verification of Parameterised FPGA Circuit Descriptions with Layout ...

Create successful ePaper yourself

Delete template?

Save as template?