Tue 25 Jun 2019 08:30 - 08:50 at 229AB - Bug Finding & Testing I Chair(s): Cindy Rubio-González

We present counterfactual symbolic execution, a new approach that produces counterexamples that localize the causes of failure of static verification.

First, we develop a notion of symbolic weak head normal form and use it to define lazy symbolic execution reduction rules for non-strict languages like Haskell. Second, we introduce counterfactual branching, a new method to identify places where verification fails due to imprecise specifications (as opposed to incorrect code). Third, we show how to use counterfactual symbolic execution to localize refinement type errors, by translating refinement types into assertions. We implement our approach in a new Haskell symbolic execution engine, G2, and evaluate it on a corpus of 7550 errors gathered from users of the LiquidHaskell refinement type system. We show that for 97.7% of these errors, G2 is able to quickly find counterexamples that show how the code or specifications must be fixed to enable verification.

Tue 25 Jun
Times are displayed in time zone: (GMT-07:00) Tijuana, Baja California change

08:30 - 09:30: PLDI Research Papers - Bug Finding & Testing I at 229AB
Chair(s): Cindy Rubio-GonzálezUniversity of California, Davis
pldi-2019-papers08:30 - 08:50
William T. HallahanYale University, Anton XueYale University, Maxwell Troy BlandUniversity of California at San Diego, USA, Ranjit JhalaUniversity of California, San Diego, Ruzica PiskacYale University, USA
Media Attached
pldi-2019-papers08:50 - 09:10
Blake Loring, Duncan MitchellRoyal Holloway, University of London, Johannes KinderBundeswehr University Munich
Media Attached
pldi-2019-papers09:10 - 09:30
Zhoulai FuIT University of Copenhagen, Denmark, Zhendong SuETH Zurich