Testing an optimising compiler by generating random lambda terms

Proceedings - International Conference on Software Engineering

Volumn , Issue , 2011, Pages 91-97

  Pałka, Michał H ^a   Claessen, Koen ^a   Russo, Alejandro ^a   Hughes, John ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

random testing; software testing

Indexed keywords

GLASGOW HASKELL COMPILERS; HASKELL; LAMBDA TERMS; OPTIMISATIONS; PRODUCTION QUALITY; RANDOM GENERATION; RANDOM TESTING; TEST DATA; TYPECHECKING;

COMPUTER SOFTWARE SELECTION AND EVALUATION; HEALTH CARE; OPTIMIZATION; SOFTWARE ENGINEERING; SOFTWARE TESTING;

PROGRAM COMPILERS;

EID: 79959403004     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1982595.1982615     Document Type: Conference Paper

References (19)

1. L. Augustsson. Announcing Djinn, version 2004-12-11, a coding wizard. http://permalink.gmane.org/ gmane.comp.lang.haskell.general/12747, 2005.
2. O. Bodini, D. Gardy, and B. Gittenberger. Lambda terms of bounded unary height. In Proc. of the 8th Workshop on Analytic Algorithmics and Combinatorics, 2011.
3. K. Claessen and J. Hughes. QuickCheck: a lightweight tool for random testing of Haskell programs. In Proceedings of the fifth ACM SIGPLAN International Conference on Functional Programming. ACM, 2000.
4. L. Damas and R. Milner. Principal type-schemes for functional programs. In Proceedings of the 9th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, 1982.
5. B. Daniel, D. Dig, K. Garcia, and D. Marinov. Automated testing of refactoring engines. In Proc. of the 6th meeting of the European Software Engineering Conference and the ACM SIGSOFT Symp. on the Foundations of Software Engineering. ACM, 2007.
6. N. A. Danielsson and P. Jansson. Chasing bottoms: A case study in program verification in the presence of partial and infinite values. In MPC, 2004.
7. D. Drienyovszky, D. Horpácsi, and S. Thompson. Quickchecking refactoring tools. In Proceedings of the 9th ACM SIGPLAN workshop on Erlang. ACM, 2010.
8. R. Dyckhoff. Contraction-free sequent calculi for intuitionistic logic. Journal of Symbolic Logic, 57(3), 1992.
9. C. Klein, M. Flatt, and R. B. Findler. Random testing for higher-order, stateful programs. In Proc. of the ACM International Conference on Object Oriented Programming Systems Languages and Applications. ACM, 2010.
10. C. Lindig. Random testing of C calling conventions. In Proceedings of the 6th International Symposium on Automated Analysis-Driven Debugging. ACM, 2005.
11. M. Moczurad, J. Tyszkiewicz, and M. Zaionc. Statistical properties of simple types. Mathematical. Structures in Computer Science, 10, October 2000.
12. S. L. Peyton Jones. Compiling Haskell by program transformation: a report from the trenches. In Proc. of European Symp. on Programming. Springer-Verlag, 1996.
13. B. C. Pierce. Types and programming languages. MIT Press, Cambridge, MA, USA, 2002.
14. A. Rodriguez Yakushev and J. Jeuring. Enumerating well-typed terms generically. In Approaches and Applications of Inductive Programming, volume 5812 of LNCS. Springer Berlin / Heidelberg, 2010.
15. The GHC Team. The Glasgow Haskell Compiler. Software release. http://haskell.org/ghc/.
16. D. Vytiniotis and A. J. Kennedy. Functional pearl: every bit counts. In Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming. ACM, 2010.
17. J. Wang. Generating random lambda calculus terms. Technical report, Boston University, 2005.
18. M. Zaionc. Mechanical procedure for proof construction via closed terms in typed λ calculus. J. Autom. Reason., 4:173-190, June 1988.
19. S. Zakhour, S. Hommel, J. Royal, I. Rabinovitch, T. Risser, and M. Hoeber. The Java Tutorial: A Short Course on the Basics, 4th Edition. Prentice Hall PTR, 2006.