Fast and sound random generation for automated testing and benchmarking in objective caml

ML'09 - Proceedings of the 2009 ACM SIGPLAN Workshop on ML

Volumn , Issue , 2009, Pages 61-69

  Canou, Benjamin ^a   Darrasse, Alexis ^a  

^a SORBONNE UNIVERSITÉ   (France)

Author keywords

Algebraic data types; Boltzmann model; Random generation; Specification based testing

Indexed keywords

ALGEBRA; BENCHMARKING; TESTING;

ALGEBRAIC DATA-TYPES; BENCHMARKING TOOLS; BOLTZMANN MODEL; GENERATION METHOD; RANDOM GENERATION; RANDOM GENERATORS; RANDOM SAMPLING METHOD; SPECIFICATION BASED TESTING;

SOFTWARE TESTING;

EID: 70450245415     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1596627.1596637     Document Type: Conference Paper

References (18)

1. M. Abbott, T. Altenkirch, N. Ghani, and C. McBride. Derivatives of containers. Lecture notes in computer science, pages 16-30, 2003.
2. F. Bergeron, G. Labelle, and P. Leroux. Combinatorial species and tree-like structures. Cambridge University Press, 1998.
3. Jacob Burnim, Sudeep Juvekar, and Koushik Sen. Wise: Automated test generation for worst-case complexity. In ICSE, pages 463-473, 2009.
4. Koen Claessen and John Hughes. Quickcheck: a lightweight tool for random testing of haskell programs. In ICFP '00: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, pages 268-279, New York, NY, USA, 2000. ACM. ISBN 1-58113-202-6. doi: 10.1145/351240.351266.
5. A. Darrasse. Random XML sampling the Boltzmann way. ArXiv e-prints, 2008. URL http://arxiv.org/abs/0807.0992.
6. Philippe Duchon, Philippe Flajolet, Guy Louchard, and Gilles Schaeffer. Boltzmann samplers for the random generation of combinatorial structures. Combinatorics, Probability and Computing, 13:577-625, 2004. doi: 10.1017/S0963548304006315.
7. Sebastian Fischer and Herbert Kuchen. Data-flow testing of declarative programs. SIGPLAN Not., 43(9):201-212, 2008. ISSN 0362-1340. doi: http://doi.acm.org/10.1145/1411203.1411233.
8. P. Flajolet, P. Zimmerman, and B. Van Cutsem. A calculus for the random generation of labelled combinatorial structures. Theoretical Computer Science, 132(1-2): 1-35, 1994.
9. Philippe Flajolet and Robert Sedgewick. Analytic Combinatorics. Cambridge University Press, 2009.
10. G. Henry, M. Mauny, and E. Chailloux. Typer la dé- sérialisation sans serialiser les types. ArXiv e-prints, May 2007. URL http://arxiv.org/abs/0705.1452.
11. G. Huet. The zipper. Journal of Functional Programming, 7(05):549-554, 1997.
12. Xavier Leroy, Didier Rémy with Damien Doligez, Jacques Garrigue, and Jérôme Vouillon. The objective caml system release 3.11 documentation and user's manual. Technical report, Inria, november 2008.
13. François Maurel. Ocaml-templates, méta-programmation à partir des types. In Actes des journeés JFLA Journées francophones des langages applicatifs, pages 21-36, Sainte-Marie-de- Ré, France, January 2004. INRIA. URL http://hal.archives-ouvertes.fr/hal- 00153820/en/.
14. Alix Mougenot, Alexis Darrasse, Xavier Blanc, and Michèle Soria. Uniform random generation of huge metamodel instances. In Fifth European Conference on Model-Driven Architecture Foundations and Applications, 2009.
15. Carine Pivoteau, Bruno Salvy, and Michèle Soria. Boltzmann oracle for combinatorial systems. In Fifth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, DMTCS Proceedings, pages 475-488, 2008.
16. C. Runciman, M. Naylor, and F. Lindblad. Smallcheck and lazy smallcheck: automatic exhaustive testing for small values. In Proceedings of the first ACM SIGPLAN symposium on Haskell, pages 37-48. ACM New York, NY, USA, 2008.
17. Koushik Sen, Darko Marinov, and Gul Agha. Cute: a concolic unit testing engine for c. In ESEC/FSE-13: Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering, pages 263-272, New York, NY, USA, 2005. ACM. ISBN 1-59593-014-0. doi: http://doi.acm.org/10.1145/1081706. 1081750.
18. Walid Taha. A gentle introduction to multi-stage programming, 2003. Available from http://www.es.rice.edu/~taha/publications/journal/dspg04a.pdf.