This program is tentative and subject to change.
Property-based testing in practice often involves writing complex input generators, which can be hard to manually verify if they cover the desired set of inputs. Coverage types have emerged as a potential solution to this problem, an analog to refinement types where functions are annotated with a subset they must be able to generate. However, users may want to treat certain inputs as “equivalent,” where they assert that the testing behavior of two distinct inputs is the same. Coverage types do not easily extend to this use case since they enforce all distinct inputs must be generated. We propose an extension to the coverage type system that incorporates equivalence relations between values, where two values are equivalent if users do not care to differentiate between them. We also update the type checking algorithm to correctly and more efficiently handle equivalence queries, and we present preliminary results of the efficacy of this approach.
This program is tentative and subject to change.
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 Victor Deng EPFL; École Normale Supérieure - PSL - CNRS, Aurèle Barrière CNRS, Clément Pit-Claudel EPFL | ||
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 | ||