Vaibhav Sharma (University of Minnesota), Navid Emamdoost (University of Minnesota), Seonmo Kim (University of Minnesota), Stephen McCamant (University of Minnesota)
It Doesn’t Have to Be So Hard: Efficient Symbolic Reasoning for CRC
View More Papers
Creating Human Readable Path Constraints from Symbolic Execution
Tod Amon (Sandia National Laboratories), Tim Loffredo (Sandia National Laboratories)
Read MoreFitM: Binary-Only Coverage-GuidedFuzzing for Stateful Network Protocols
Dominik Maier, Otto Bittner, Marc Munier, Julian Beier (TU Berlin)
Read MoreInspecting Compiler Optimizations on Mixed Boolean Arithmetic Obfuscation
Rachael Little, Dongpeng Xu (University of New Hampshire)
Read Morecozy: Comparative Symbolic Execution for Binary Programs
Caleb Helbling, Graham Leach-Krouse, Sam Lasser, Greg Sullivan (Draper)
Read More