Concolic Fuzzing -- Or how to run a theorem prover on your Julia code
07-25, 16:55–17:05 (US/Eastern), Elm B

Concolic testing is a technique that uses concrete execution to create a symbolic representation of a program, which can be used to prove properties of programs or do provable exhaustive fuzzing.

In this talk we will explore how to use Cassette to extract a symbolic trace from a Julia program and using that capability to prove properties of Julia programs . This also enables fuzzing and automated test-case development.
Valentin Churavy

PhD student at the MIT JuliaLab, HPC enthusiast.

This speaker also appears in: