1. Alur R., Dang T., Ivančić F.: Predicate abstraction for reachability analysis of hybrid systems. ACM Trans. Embed. Comput. Syst. 5(1), 152–199 (2006)
2. Boldo, S.: Preuves formelles en arithmétiques à virgule flottante. PhD thesis, École Normale Supérieure de Lyon (2004)
3. Boldo, S.: Formal verification of numerical programs: from C annotated programs to coq proofs. In: Fainekos, G., Goubault, E., Putot, S. (eds.) Proceedings of the NSV-3, Edinburgh, UK (2010) (Federated Logic Conference)
4. Boldo, S., Filliâtre, J.-C.: Formal verification of floating-point programs. In: Muller, J.-M., Kornerup, P. (eds.) Proceedings of the ARITH-18, pp. 187–194. IEEE Computer Society Press, New York (2007)
5. Boldo S., Filliâtre J.-C., Melquiond G.: Combining Coq and Gappa for certifying floating-point programs. In: Carette, J., Dixon, L., Coen, C.S., Watt, S.M. (eds) Proceedings of the Calculemus/MKM 2009. LNCS, vol. 5625, pp. 59–74. Springer, Berlin (2009)