Sylvain Chevillard, Mioara Joldeş & Christoph Lauter (2010):
Sollya: An Environment for the Development of Numerical Codes.
In: Komei Fukuda, Joris van der Hoeven, Michael Joswig & Nobuki Takayama: 3rd International Congress on Mathematical Software (ICMS),
Lecture Notes in Computer Science 6327,
Kobe, Japan,
pp. 28–31,
doi:10.1007/978-3-642-15582-6_5.
Assia Mahboubi, Guillaume Melquiond & Thomas Sibut-Pinote (2019):
Formally Verified Approximations of Definite Integrals.
Journal of Automated Reasoning 62(2),
pp. 281–300,
doi:10.1007/s10817-018-9463-7.
Érik Martin-Dorel, Micaela Mayero, Ioana Pasca, Laurence Rideau & Laurent Théry (2013):
Certified, Efficient and Sharp Univariate Taylor Models in Coq.
In: 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC),
Timisoara, Romania,
pp. 193–200,
doi:10.1109/SYNASC.2013.33.
Érik Martin-Dorel & Guillaume Melquiond (2016):
Proving Tight Bounds on Univariate Expressions with Elementary Functions in Coq.
Journal of Automated Reasoning 57(3),
pp. 187–217,
doi:10.1007/s10817-015-9350-4.
Russell O'Connor (2008):
A Computer Verified Theory of Compact Sets.
In: Symbolic Computation in Software Science Austrian-Japanese Workshop (SCSS),
RISC-Linz Report Series,
pp. 148–162.
Fernando Pérez & Brian E. Granger (2007):
IPython: a System for Interactive Scientific Computing.
Computing in Science and Engineering 9(3),
pp. 21–29,
doi:10.1109/MCSE.2007.53.