1. Testing Erlang data types with quviq quickcheck
2. Turning Inductive into Equational Specifications
3. Stefan Berghofer and Tobias Nipkow . 2002 . Executing Higher Order Logic. In International Workshop on Types for Proofs and Programs (TYPES) (Lecture Notes in Computer Science , Vol. 2277). Springer, 24– 40 . isbn:3-540-43287-6 http://www4.in.tum.de/publ/papers/TYPES2000.pdf Stefan Berghofer and Tobias Nipkow. 2002. Executing Higher Order Logic. In International Workshop on Types for Proofs and Programs (TYPES) (Lecture Notes in Computer Science, Vol. 2277). Springer, 24–40. isbn:3-540-43287-6 http://www4.in.tum.de/publ/papers/TYPES2000.pdf
4. * Proof by Reflection
5. Lukas Bulwahn . 2012 . The New Quickcheck for Isabelle - Random, Exhaustive and Symbolic Testing under One Roof . In 2nd International Conference on Certified Programs and Proofs (CPP) (Lecture Notes in Computer Science , Vol. 7679). Springer, 92– 108 . https://www.irisa.fr/celtique/genet/ACF/BiblioIsabelle/quickcheckNew.pdf Lukas Bulwahn. 2012. The New Quickcheck for Isabelle - Random, Exhaustive and Symbolic Testing under One Roof. In 2nd International Conference on Certified Programs and Proofs (CPP) (Lecture Notes in Computer Science, Vol. 7679). Springer, 92–108. https://www.irisa.fr/celtique/genet/ACF/BiblioIsabelle/quickcheckNew.pdf