research-article

Experience report: applying random testing to a base type environment

Authors:

Vincent St-Amour,

Neil TorontoAuthors Info & Claims

ACM SIGPLAN Notices, Volume 48, Issue 9

Pages 351 - 356

https://doi.org/10.1145/2544174.2500616

Published: 25 September 2013 Publication History

Get Access

Abstract

As programmers, programming in typed languages increases our confidence in the correctness of our programs. As type system designers, soundness proofs increase our confidence in the correctness of our type systems. There is more to typed languages than their typing rules, however. To be usable, a typed language needs to provide a well-furnished standard library and to specify types for its exports.

As software artifacts, these base type environments can rival typecheckers in complexity. Our experience with the Typed Racket base environment---which accounts for 31% of the code in the Typed Racket implementation---teaches us that writing type environments can be just as error-prone as writing typecheckers.

We report on our experience over the past two years of using random testing to increase our confidence in the correctness of the Typed Racket base environment.

References

[1]

Stefan Berghofer and Tobias Nipkow. Random testing in Isabelle/HOL. In Proc. Conf. on Software Engineering and Formal Methods, pp. 230--239, 2004.

Digital Library

Google Scholar

[2]

Koen Claessen and John Hughes. QuickCheck: a lightweight tool for random testing of Haskell programs. In Proc. International Conf. on Functional Programming, pp. 268--279, 2000.

Digital Library

Google Scholar

[3]

Robert DeLine and Manuel Fähndrich. Enforcing high-level protocols in low-level software. In Proc. Conf. on Programming Language Design and Implementation, pp. 59--69, 2001.

Digital Library

Google Scholar

[4]

Matthias Felleisen, Robert Bruce Findler, and Matthew Flatt. Semantics Engineering with PLT Redex. MIT Press, 2009.

Digital Library

Google Scholar

[5]

Matthew Flatt and PLT. Reference: Racket. PLT Inc., PLT-TR-2010-1, 2010. http://racket-lang.org/tr1/

Google Scholar

[6]

C. Barry Jay. Programming in FISh. International Journal on Software Tools for Technology Transfer 2(3), pp. 307--315, 1999.

Crossref

Google Scholar

[7]

Casey Klein, John Clements, Christos Dimoulas, Carl Eastlund, Matthias Felleisen, Matthew Flatt, Jay McCarthy, Jon Rafkind, Sam Tobin-Hochstadt, and Robert Bruce Findler. Run your research: on the effectiveness of lightweight mechanization. In Proc. Symp. on Principles of Programming Languages, pp. 285--296, 2012.

Digital Library

Google Scholar

[8]

Casey Klein and Robert Bruce Findler. Randomized testing in PLT Redex. In Proc.Works. Scheme and Functional Programming, pp. 26--36, 2010.

Google Scholar

[9]

Casey Klein, Matthew Flatt, and Robert Bruce Findler. The Racket virtual machine and randomized testing. Higher-Order and Symbolic Computation, 2013.

Google Scholar

[10]

Lindsey Kuper and Ryan Newton. A lattice-theoretical approach to deterministic parallelism with shared state. Indiana University, TR702, 2012.

Google Scholar

[11]

Rex Page, Carl Eastlund, and Matthias Felleisen. Functional programming and theorem proving for undergraduates: a progress report. In Proc. Works. Functional and Declarative Programming in Education, pp. 21--30, 2008.

Digital Library

Google Scholar

[12]

Vincent St-Amour, Sam Tobin-Hochstadt, Matthew Flatt, and Matthias Felleisen. Typing the numeric tower. In Proc. Practical Aspects of Declarative Languages, pp. 289--303, 2012.

Digital Library

Google Scholar

[13]

Sam Tobin-Hochstadt and Matthias Felleisen. The design and implementation of Typed Scheme. In Proc. Symp. on Principles of Programming Languages, pp. 395--406, 2008.

Digital Library

Google Scholar

[14]

Jesse A. Tov and Riccardo Pucella. Practical affine types. In Proc. Symp. on Principles of Programming Languages, pp. 447--458, 2011.

Digital Library

Google Scholar

Cited By

View all

Greenman BFelleisen MDimoulas C(2019)Complete monitors for gradual typesProceedings of the ACM on Programming Languages10.1145/33605483:OOPSLA(1-29)Online publication date: 10-Oct-2019
https://dl.acm.org/doi/10.1145/3360548
Midtgaard JMøller A(2017)QuickChecking static analysis propertiesSoftware Testing, Verification and Reliability10.1002/stvr.164027:6Online publication date: 30-Aug-2017
https://doi.org/10.1002/stvr.1640
Lazarek LGreenman BFelleisen MDimoulas C(2023)How to Evaluate Blame for Gradual Types, Part 2Proceedings of the ACM on Programming Languages10.1145/36078367:ICFP(159-186)Online publication date: 30-Aug-2023
https://dl.acm.org/doi/10.1145/3607836
Show More Cited By

Index Terms

Experience report: applying random testing to a base type environment
1. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
      1. Software defect analysis
        Software testing and debugging
  2. Software notations and tools
    1. General programming languages
      1. Language features

Recommendations

Experience report: applying random testing to a base type environment
ICFP '13: Proceedings of the 18th ACM SIGPLAN international conference on Functional programming

As programmers, programming in typed languages increases our confidence in the correctness of our programs. As type system designers, soundness proofs increase our confidence in the correctness of our type systems. There is more to typed languages than ...
Experience report: type-checking polymorphic units for astrophysics research in Haskell
Haskell '14: Proceedings of the 2014 ACM SIGPLAN symposium on Haskell

Many of the bugs in scientific programs have their roots in mistreatment of physical dimensions, via erroneous expressions in the quantity calculus. Now that the type system in the Glasgow Haskell Compiler is rich enough to support type-level integers ...
Experience report: type-checking polymorphic units for astrophysics research in Haskell
Haskell '14

Many of the bugs in scientific programs have their roots in mistreatment of physical dimensions, via erroneous expressions in the quantity calculus. Now that the type system in the Glasgow Haskell Compiler is rich enough to support type-level integers ...

Comments

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 48, Issue 9

ICFP '13

September 2013

457 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/2544174

Editor:
Mark W. Bailey
Hamilton College, Clinton, NY

Issue’s Table of Contents

ICFP '13: Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
September 2013
484 pages
ISBN:9781450323260
DOI:10.1145/2500365
General Chair:
Greg Morrisett
Harvard University, USA
,
Program Chair:
Tarmo Uustalu
Institute of Cybernetics at TUT, Estonia

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 September 2013

Published in SIGPLAN Volume 48, Issue 9

Check for updates

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
120
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)1

Reflects downloads up to 14 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Greenman BFelleisen MDimoulas C(2019)Complete monitors for gradual typesProceedings of the ACM on Programming Languages10.1145/33605483:OOPSLA(1-29)Online publication date: 10-Oct-2019
https://dl.acm.org/doi/10.1145/3360548
Midtgaard JMøller A(2017)QuickChecking static analysis propertiesSoftware Testing, Verification and Reliability10.1002/stvr.164027:6Online publication date: 30-Aug-2017
https://doi.org/10.1002/stvr.1640
Lazarek LGreenman BFelleisen MDimoulas C(2023)How to Evaluate Blame for Gradual Types, Part 2Proceedings of the ACM on Programming Languages10.1145/36078367:ICFP(159-186)Online publication date: 30-Aug-2023
https://dl.acm.org/doi/10.1145/3607836
Lazarek LGreenman BFelleisen MDimoulas C(2021)How to evaluate blame for gradual typesProceedings of the ACM on Programming Languages10.1145/34735735:ICFP(1-29)Online publication date: 19-Aug-2021
https://dl.acm.org/doi/10.1145/3473573
Campora JChen S(2020)Taming type annotations in gradual typingProceedings of the ACM on Programming Languages10.1145/34282594:OOPSLA(1-30)Online publication date: 13-Nov-2020
https://dl.acm.org/doi/10.1145/3428259
Midtgaard J(2018)QuickChecking Patricia TreesTrends in Functional Programming10.1007/978-3-319-89719-6_4(59-78)Online publication date: 19-Apr-2018
https://doi.org/10.1007/978-3-319-89719-6_4
Midtgaard JJustesen MKasting PNielson FNielson H(2017)Effect-driven QuickChecking of compilersProceedings of the ACM on Programming Languages10.1145/31102591:ICFP(1-23)Online publication date: 29-Aug-2017
https://dl.acm.org/doi/10.1145/3110259
Dewey KRoesch JHardekopf BCohen MGrunske LWhalen M(2015)Fuzzing the rust typechecker using CLPProceedings of the 30th IEEE/ACM International Conference on Automated Software Engineering10.1109/ASE.2015.65(482-493)Online publication date: 9-Nov-2015
https://dl.acm.org/doi/10.1109/ASE.2015.65
Feldthaus AMøller A(2014)Checking correctness of TypeScript interfaces for JavaScript librariesACM SIGPLAN Notices10.1145/2714064.266021549:10(1-16)Online publication date: 15-Oct-2014
https://dl.acm.org/doi/10.1145/2714064.2660215
Feldthaus AMøller ABlack AMillstein T(2014)Checking correctness of TypeScript interfaces for JavaScript librariesProceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications10.1145/2660193.2660215(1-16)Online publication date: 15-Oct-2014
https://dl.acm.org/doi/10.1145/2660193.2660215

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Experience report: applying random testing to a base type environment

Experience report: type-checking polymorphic units for astrophysics research in Haskell

Experience report: type-checking polymorphic units for astrophysics research in Haskell