Wed 26 Aug 2026 15:03 - 15:09 at IP126 Auditorium - SRC Presentations
Property-based testing (PBT) with QuickChick relies on extracting Rocq programs to OCaml. However, this extraction mechanism, while crucial for QuickChick to function, has significant performance implications. In this work, we describe how we optimized QuickChick, exploiting various opportunities offered by program extraction to significantly improve each test’s extraction, compilation, and running time. We also evaluate these improvements using the ETNA benchmarking platform for PBT to assess how individual improvements impacted the overall test run time.
Wed 26 AugDisplayed time zone: Eastern Time (US & Canada) change
Wed 26 Aug
Displayed 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 | ||