A. W. Appel, Efficient verified red-black trees, 2011.

T. Arts, J. Hughes, J. Johansson, and U. T. Wiger, Testing telecoms software with quviq QuickCheck, Proceedings of the 2006 ACM SIGPLAN workshop on Erlang , ERLANG '06, 2006.
DOI : 10.1145/1159789.1159792

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

S. Berghofer, L. Bulwahn, and F. Haftmann, Turning inductive into equational specifications. TPHOLs, 2009.
DOI : 10.1007/978-3-642-03359-9_11

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

S. Berghofer and T. Nipkow, Executing Higher Order Logic, TYPES, 2002.
DOI : 10.1007/3-540-45842-5_2

S. Berghofer and T. Nipkow, Random testing in, 2004.

A. D. Brucker, L. Brügger, and B. Wolff, Formal firewall conformance testing: an application of test and proof techniques, Software Testing, Verification and Reliability, vol.220, issue.1, pp.34-71, 2015.
DOI : 10.1002/stvr.1544

URL : https://hal.archives-ouvertes.fr/hal-01213717

A. D. Brucker and B. Wolff, Interactive Testing with HOL-TestGen, Proceedings of the 5th International Conference on Formal Approaches to Software Testing, 2006.
DOI : 10.1023/A:1022920129859

A. D. Brucker and B. Wolff, On theorem prover-based testing, Formal Aspects of Computing, vol.29, issue.4, pp.683-721, 2013.
DOI : 10.1007/s00165-012-0222-y

L. Bulwahn, The new Quickcheck for Isabelle -random, exhaustive and symbolic testing under one roof, 2012.

L. Bulwahn, Smart Testing of Functional Programs in Isabelle
DOI : 10.1007/978-3-642-28717-6_14

L. Bulwahn, Counterexample Generation for Higher-Order Logic Using Functional and Logic Programming, 2013.

M. Carlier, C. Dubois, and A. Gotlieb, A First Step in the Design of a Formally Verified Constraint-Based Testing Tool: FocalTest, 2012.
DOI : 10.1007/978-3-642-30473-6_5

URL : https://hal.archives-ouvertes.fr/hal-01126115

M. Carlier, C. Dubois, and A. Gotlieb, FocalTest: A Constraint Programming Approach for Property-Based Testing, 2013.
DOI : 10.1007/978-3-642-29578-2_9

H. R. Chamarthi, P. C. Dillinger, M. Kaufmann, and P. Manolios, Integrating Testing and Interactive Theorem Proving, Electronic Proceedings in Theoretical Computer Science, vol.70, p.2, 2011.
DOI : 10.4204/EPTCS.70.1

URL : http://doi.org/10.4204/eptcs.70.1

J. Christiansen and S. Fischer, EasyCheck ? test data for free. FLOPS, 2008.

K. Claessen, Shrinking and showing functions: (functional pearl) Haskell Symposium, 2012.

K. Claessen, J. Duregård, and M. H. Pa?ka, Generating constrained random data with uniform distribution. FLOPS, 2014.

K. Claessen and J. Hughes, QuickCheck: a lightweight tool for random testing of Haskell programs, 2000.

K. Claessen and M. Pa?ka, Splittable pseudorandom number generators using cryptographic hashing. Haskell Symposium, 2013.
DOI : 10.1145/2503778.2503784

URL : http://publications.lib.chalmers.se/records/fulltext/183348/local_183348.pdf

D. Delahaye, C. Dubois, and J. Étienne, Extracting purely functional contents from logical inductive types. TPHOLs, 2007.
DOI : 10.1007/978-3-540-74591-4_7

URL : https://hal.archives-ouvertes.fr/hal-01125370

J. Duregård, P. Jansson, and M. Wang, Feat: Functional enumeration of algebraic types. Haskell Symposium, 2012.

P. Dybjer, Q. Haiyan, and M. Takeyama, Combining testing and proving in dependent type theory. TPHOLs, 2003.

P. Dybjer, Q. Haiyan, and M. Takeyama, Random generators for dependent types. ICTAC, 2004.

C. Eastlund, DoubleCheck your theorems, Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications, ACL2 '09, 2009.
DOI : 10.1145/1637837.1637844

B. Fetscher, K. Claessen, M. H. Palka, J. Hughes, and R. B. Findler, Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System, 2015.
DOI : 10.1007/978-3-662-46669-8_16

S. Fischer and H. Kuchen, Systematic generation of glass-box test cases for functional logic programs. PPDP, 2007.

J. A. Goguen and J. Meseguer, Unwinding and Inference Control, 1984 IEEE Symposium on Security and Privacy, 1984.
DOI : 10.1109/SP.1984.10019

G. Gonthier and A. Mahboubi, An introduction to small scale reflection in Coq, JFR, vol.3, issue.2, pp.95-152, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00515548

Q. Haiyan, Testing and Proving in Dependent Type Theory, 2003.

C. Hri¸tcuhri¸tcu, L. Lampropoulos, A. Spector-zabusky, A. A. De-amorim, M. Dénès et al., Testing noninterference, quickly, 2014.

J. Hughes, QuickCheck testing for fun and profit. PADL, 2007.
DOI : 10.1007/978-3-540-69611-7_1

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

M. P. Jones, Functional programming with overloading and higher-order polymorphism. Advanced Functional Programming, 1995.

C. Klein, J. Clements, C. Dimoulas, C. Eastlund, M. Felleisen et al., Run your research: On the effectiveness of lightweight mechanization, 2012.

C. Okasaki, Red-black trees in a functional setting, Journal of Functional Programming, vol.9, issue.4, pp.471-477, 1999.
DOI : 10.1017/S0956796899003494

S. Owre, Random testing in PVS, Workshop on Automated Formal Methods, 2006.

Z. Paraskevopoulou and C. Hri¸tcuhri¸tcu, A Coq framework for verified property-based testing, Internship Report, 2014.

C. Runciman, M. Naylor, and F. Lindblad, SmallCheck and Lazy SmallCheck: automatic exhaustive testing for small values. Haskell Symposium, 2008.

M. Sozeau, A new look at generalized rewriting in type theory, JFR, vol.2, issue.1, pp.41-62, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00628904

P. Tollitte, D. Delahaye, and C. Dubois, Producing Certified Functional Code from Inductive Specifications, 2012.
DOI : 10.1007/978-3-642-35308-6_9

URL : https://hal.archives-ouvertes.fr/hal-01126212

S. Wilson, Supporting dependently typed functional programming with proof automation and testing, 2011.