Skip to main content
Springer Nature Link
Log in

QuickCheck Testing for Fun and Profit

  • Conference paper
Practical Aspects of Declarative Languages (PADL 2007)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4354))

Included in the following conference series:

  • 739 Accesses

Abstract

One of the nice things about purely functional languages is that functions often satisfy simple properties, and enjoy simple algebraic relationships. Indeed, if the functions of an API satisfy elegant laws, that in itself is a sign of a good design—the laws not only indicate conceptual simplicity, but are useful in practice for simplifying programs that use the API, by equational reasoning or otherwise.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Arts, T., Claessen, K., Hughes, J., Svensson, H.: Testing implementations of formally verified algorithms. In: Proceedings of the 5th Conference on Software Engineering Research and Practice, Sweden (2005)

    Google Scholar 

  2. Ball, T., Bounimova, E., Cook, B., Levin, V., Lichtenberg, J., McGarvey, C., Ondrusek, B., Rajamani, S., Ustuner, A.: Thorough static analysis of device drivers. In: EuroSys 2006 (2006)

    Google Scholar 

  3. Beck, K.: Extreme Programming Explained: Embrace Change, 2nd edn. Addison Wesley Professional, Reading (2004)

    Google Scholar 

  4. Claessen, K., Hughes, J.: Quickcheck: a lightweight tool for random testing of haskell programs. In: ICFP 2000: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, pp. 268–279. ACM Press, New York (2000)

    Chapter  Google Scholar 

  5. Claessen, K., Hughes, J.: Testing monadic code with quickcheck. In: Haskell 2002: Proceedings of the 2002 ACM SIGPLAN workshop on Haskell, pp. 65–77. ACM Press, New York (2002)

    Chapter  Google Scholar 

  6. Claessen, K., Hughes, J.: Specification-based testing with QuickCheck. In: Gibbons, J., de Moor, O. (eds.) Fun of Programming, Cornerstones of Computing, Palgrave (March 2003)

    Google Scholar 

  7. Claessen, K., Runciman, C., Chitil, O., Hughes, J., Wallace, M.: Testing and tracing lazy functional programs using quickcheck and hat. In: Jeuring, J., Jones, S.L.P. (eds.) AFP 2002. LNCS, vol. 2638. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Fewster, M., Graham, D.: Software test automation: effective use of test execution tools. ACM Press/Addison-Wesley Publishing Co., New York (1999)

    Google Scholar 

  9. Flanagan, C., Leino, K.R.M., Lillibridge, M., Nelson, G., Saxe, J.B., Stata, R.: Extended static checking for Java. In: Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation (PLDI 2002), vol. 37, pp. 234–245 (June 2002)

    Google Scholar 

  10. Hamlet, D.: Random testing. In: Marciniak, J. (ed.) Encyclopedia of Software Engineering, pp. 970–978. Wiley, Chichester (1994)

    Google Scholar 

  11. Hildebrandt, R., Zeller, A.: Simplifying failure-inducing input. In: ISSTA 2000: Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis, pp. 135–145. ACM Press, New York (2000)

    Google Scholar 

  12. Leroy, X.: Formal certification of a compiler back-end or: programming a compiler with a proof assistant. In: POPL, pp. 42–54 (2006)

    Google Scholar 

  13. Marciniak, J., Vienneau, R.: Software engineering baselines. Technical report, Data and Analysis Center for Software (1996), http://www.dacs.dtic.mil/techs/baselines/

  14. Miller, B.P., Fredriksen, L., So, B.: An empirical study of the reliability of unix utilities. Commun. ACM 33(12), 32–44 (1990)

    Article  Google Scholar 

  15. Okasaki, C.: Fun with binary heap trees. In: Gibbons, J., de Moor, O. (eds.) Fun of Programming. Cornerstones of Computing, Palgrave, pp. 1–16 (March 2003)

    Google Scholar 

  16. Telecommunication Standardization sector of ITU. ITU-T Rec. H248.1, gateway control protocol. Technical report, International Telecommunication Union (September 2005)

    Google Scholar 

  17. Stoller, S.: Leader election in distributed systems with crash failures. Technical Report 169, Indiana University (1997)

    Google Scholar 

  18. Wiger, U., Ask, G., Boortz, K.: World-class product certification using erlang. SIGPLAN Not 37(12), 25–34 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chalmers University of Technology, S-41296, Gothenburg, Sweden

    John Hughes

Authors
  1. John Hughes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, CAU Kiel, Germany

    Michael Hanus

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hughes, J. (2006). QuickCheck Testing for Fun and Profit. In: Hanus, M. (eds) Practical Aspects of Declarative Languages. PADL 2007. Lecture Notes in Computer Science, vol 4354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69611-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69611-7_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69608-7

  • Online ISBN: 978-3-540-69611-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics