P. Bjesse, K. Claessen, M. Sheeran, and E. S. Singh, Lava : hardware design in haskell, Proceedings of the third ACM SIGPLAN, 1998.

K. Claessen and M. Sheeran, The Lava programming language, 2005.

G. Berry, Esterel and jazz : Two synchronous languages for circuit designEn ligne] Disponible : http://www.springerlink.com/content/kf0nxvlxk0lfny2c [7] Wikipédia Taux de compression ? wikipédia, l'en- cyclopédie libre, pp.1-1, 1999.

P. Elias, Universal codeword sets and representations of the integers, IEEE Transactions on Information Theory, vol.21, issue.2, pp.194-203, 1975.
DOI : 10.1109/TIT.1975.1055349

F. T. Leighton, Introduction to parallel algorithms and architectures : array, trees, hypercubes, 1992.

G. Berry, P. Bertin, F. Bourdoncle, A. Frey, and E. J. Vuillemin, A strongly typed object language for circuit synthesis, 1996.

N. Halbwachs, P. Caspi, P. Raymond, and E. D. Pilaud, The synchronous data flow programming language LUSTRE, Proceedings of the IEEE, vol.79, issue.9, pp.1305-1320, 1991.
DOI : 10.1109/5.97300

M. Pouzet, Lucid Synchrone, version 3. Tutorial and reference manual, 2006.

P. Wadler, Monads for functional programming, " dans First International Spring School on Advanced Functional Programming Techniques

R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and E. F. Zadek, Efficiently computing static single assignment form and the control dependence graph, ACM Transactions on Programming Languages and Systems, vol.13, issue.4, pp.451-490, 1991.
DOI : 10.1145/115372.115320

R. E. Moore, Interval Analysis, 1966.

N. S. Nedialkov, V. Kreinovich, and S. A. Starks, Interval Arithmetic, Affine Arithmetic, Taylor Series Methods: Why, What Next?, Numerical Algorithms, vol.37, issue.1-4, 2003.
DOI : 10.1023/B:NUMA.0000049478.42605.cf

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.1077

P. Cousot and N. Halbwachs, Automatic discovery of linear restraints among variables of a program, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '78, pp.84-97, 1978.
DOI : 10.1145/512760.512770

P. Cousot, The astrée static analyzer Ecole Normale Supérieure, 2005.

C. E. Leiserson, J. B. Saxe-alto, C. Tech, and . Rep, Retiming synchronous circuitry, Algorithmica, vol.9, issue.No. 1
DOI : 10.1007/BF01759032

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.368.3222

A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, 1974.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and E. C. Stein, Introduction to algorithms, 1992.

E. Nuutila, Efficient transitive closure computation in large digraphs Acta Polytechnica Scandinavia : Math, Comput. Eng, vol.74, pp.1-124, 1995.

B. Dutertre and L. De-moura, The yices smt solver

J. Cortadella, M. Kishinevsky, and E. B. Grundmann, Self : Specification and design of a synchronous elastic architecture for dsm systems, Tech. Rep, 2006.

. Xilinx, Disponible : http://www.xilinx.com/bvdocs/publications/ds031.pdf [26] Wikipédia Binary prefix ? wikipedia, the free encyclopedia [Online ; accessed 13, Virtex-II DataSheet DS031, 2005.

. Xilinx, Virtex-2 Platform FPGA User Guide (UG002 version 2.0), " Mars, 2005.

J. Vuillemin, On circuits and numbers, IEEE Transactions on Computers, vol.43, issue.8, pp.868-879, 1994.
DOI : 10.1109/12.295849

J. Hervé, F. Morain, D. Salesin, B. Serpette, J. Vuillemin et al., Bignum : un module portable et efficace pour une arithmetique a precision arbitraire, INRIA, Tech. Rep

J. Vuillemin, P. Bertin, D. Roncin, M. Shand, H. Touati et al., Programmable active memories: reconfigurable systems come of age, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol.4, issue.1, pp.56-69, 1996.
DOI : 10.1109/92.486081

G. Kahn, The semantics of a simple language for parallel programming, Proceedings of the IFIP Congress, pp.471-475, 1974.

G. Kahn and D. B. Macqueen, Coroutines and networks of parallel processes, Proceedings of the IFIP Congress, pp.993-998, 1977.
URL : https://hal.archives-ouvertes.fr/inria-00306565

L. Moll, A. Heirich, E. M. Shand, K. L. Pocek, and J. , Sepia: scalable 3D compositing using PCI Pamette, Seventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines (Cat. No.PR00375), pp.146-155, 1999.
DOI : 10.1109/FPGA.1999.803676

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.177.2620

M. Shand-ecole-normale and . Supérieure, Programmation de la carte pci pamette, 2005.

R. Ginosar, Fourteen ways to fool your synchronizer, Ninth International Symposium on Asynchronous Circuits and Systems, 2003. Proceedings., p.89, 2003.
DOI : 10.1109/ASYNC.2003.1199169

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.206.935

A. Cohen, M. Duranton, C. Eisenbeis, C. Pagetti, F. Plateau et al., N -Synchronous Kahn Networks : a Relaxed Model of Synchrony for Real-Time Systems, dans ACM International Conference on Principles of Programming Languages] Standard Co-Emulation Modeling Interface (SCE-MI) Reference Manual, 2003.

L. Moll, M. Shand, K. L. Pocek, and J. , Systems performance measurement on PCI Pamette, Proceedings. The 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines Cat. No.97TB100186), pp.125-133, 1997.
DOI : 10.1109/FPGA.1997.624612

H. Touati and M. Shand, PamDC : a C++ Library for the Simulation and Generation of Xilinx FPGA Designs, 1999.

J. Note and J. Vuillemin, Towards automatically compiling efficien fpga hardware, dans Proceedings of the International Workshop on Hardware Design and Functional Languages, pp.115-124, 2007.

J. Tuan, T. Chang, and C. Jen, On the data reuse and memory bandwidth analysis for full-search block-matching VLSI architecture, IEEE Transactions on Circuits and Systems for Video Technology, vol.12, issue.1, pp.61-72, 2002.
DOI : 10.1109/76.981846

N. Nethercote and J. Seward, Valgrind : A program supervision framework, Electronic Notes in Theoretical Computer Science, vol.89, issue.2, 2003.

J. Hopcroft, W. Paul, and E. L. Valiant, On Time Versus Space, Journal of the ACM, vol.24, issue.2, pp.332-337, 1977.
DOI : 10.1145/322003.322015

C. D. Thompson, Area-time complexity for VLSI, Proceedings of the eleventh annual ACM symposium on Theory of computing , STOC '79, pp.81-88, 1979.
DOI : 10.1145/800135.804401

C. Harris and M. Stephens, dans Proceedings of The Fourth Alvey Vision Conference Disponible : http://www.csse.uwa, Gpgpu ? wikipedia, the free encyclopedia, pp.147-151, 1988.