Programs under construction routinely contain incomplete code paths, yet no testing framework—to our knowledge—distinguishes incompleteness from failure. We propose incremental property-based testing (IPBT): a framework can be both tolerant of incompleteness, so partial code does not produce spurious failures, and informative about it, reporting which incomplete cases are exercised and how often, supporting prioritization of next implementation steps.
IPBT requires no language extension and only slight adjustments to an existing framework; the reformulation is entirely hidden from the user. For experimentation, we instantiate IPBT in QCheck2 for OCaml, and evaluate it on a lambda-calculus substitution example and the multicoretests suite for the OCaml 5 compiler.
Wed 26 AugDisplayed time zone: Eastern Time (US & Canada) change
14:45 - 15:15 | |||
14:45 6mPoster | Better Safe and Sorry: Tabular Types for Dynamic Languages ICFP SRC Vincent H. Chan University at Buffalo, SUNY, Matías Toro University of Chile, Qianchuan Ye University at Buffalo, SUNY | ||
14:51 6mPoster | Coverage Types Modulo Equivalences ICFP SRC | ||
14:57 6mPoster | JavaScript Regular Expression Matching is PSPACE-Complete ICFP SRC | ||
15:03 6mPoster | QuickerChick ICFP SRC Ivan Mladenov University of Maryland, College Park, Alperen Keles University of Maryland at College Park, Leonidas Lampropoulos University of Maryland at College Park | ||
15:09 6mPoster | Incremental Property-Based Testing ICFP SRC | ||