R. Yates, Fixed-Point Arithmetic: An Introduction, Digital Signal Labs, 2009.

P. Cousot and R. Cousot, Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixed points, Principles of Programming Languages 4, pp.238-252, 1977.

R. Tate, M. Stepp, Z. Tatlock, and S. Lerner, Equality saturation: A new approach to optimization, POPL '09: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages, pp.264-276, 2009.

D. Boland and G. A. Constantinides, A scalable approach for automated precision analysis, Proceedings of the ACM/SIGDA international symposium on Field Programmable Gate Arrays, FPGA '12, pp.185-194
DOI : 10.1145/2145694.2145726

T. Hilaire and P. Chevrel, Sensitivity-based pole and inputoutput errors of linear filters as indicators of the implementation deterioration in fixed-point context, EURASIP Journal of Advanced Signal Processing, vol.2011, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01146526

K. Parashar, R. Rocher, D. Menard, and O. Sentieys, A Hierarchical Methodology for Word-Length Optimization of Signal Processing Systems, 2010 23rd International Conference on VLSI Design, pp.318-323, 2010.
DOI : 10.1109/VLSI.Design.2010.66
URL : https://hal.archives-ouvertes.fr/inria-00432590

R. Rocher, D. Menard, N. Herve, and S. , Fixed-point configurable hardware components, EURASIP Journal on Embedded Systems (JES), 2006.
DOI : 10.1186/1687-3963-2006-023197
URL : https://hal.archives-ouvertes.fr/inria-00455557

R. Rocher, D. Menard, O. Sentieys, and P. Scalart, Analytical accuracy evaluation of fixed-point systems, EUSIPCO'07, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00454534

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck, 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

S. Touati and D. Barthou, On the decidability of phase ordering problem in optimizing compilation, Proceedings of the 3rd conference on Computing frontiers , CF '06, pp.147-156, 2006.
DOI : 10.1145/1128022.1128042
URL : https://hal.archives-ouvertes.fr/hal-00141063

C. Mouilleron, Efficient computation with structured matrices and arithmetic expressions, 2011.
URL : https://hal.archives-ouvertes.fr/tel-00688388

P. Langlois, M. Martel, and L. Thévenoux, Accuracy versus time, Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, PASCO '10, pp.121-130, 2010.
DOI : 10.1145/1837210.1837229
URL : https://hal.archives-ouvertes.fr/hal-00477511

R. A. Ballance, A. B. Maccabe, and K. J. Ottenstein, The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages, Proceedings of the ACM SIGPLAN 1990 Conference on Programming Language Design and Implementation, pp.257-271, 1990.

P. Tu and D. Padua, Efficient building and placing of gating functions, Proceedings of the ACM SIGPLAN 1995 Conference on Programming Language Design and Implementation, pp.47-55, 1995.

J. Choi, R. Cytron, and J. Ferrante, Automatic construction of sparse data flow evaluation graphs, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, pp.55-66, 1991.
DOI : 10.1145/99583.99594

P. Briggs, K. D. Cooper, T. J. Harvey, and L. T. Simpson, Practical improvements to the construction and destruction of static single assignment form, Software -Practice and Experience, pp.859-881, 1998.
DOI : 10.1002/(SICI)1097-024X(19980710)28:8<859::AID-SPE188>3.0.CO;2-8