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
B2R2: Building an Efficient Front-End for Binary Analysis
Minkyu Jung (KAIST), Soomin Kim (KAIST), HyungSeok Han (KAIST), Jaeseung Choi (KAIST), Sang Kil Cha (KAIST)
Read MoreFitM: Binary-Only Coverage-GuidedFuzzing for Stateful Network Protocols
Dominik Maier, Otto Bittner, Marc Munier, Julian Beier (TU Berlin)
Read MorePISE: Protocol Inference using Symbolic Execution and Automata Learning
Ron Marcovich, Orna Grumberg, Gabi Nakibly (Technion, Israel Institute of Technology)
Read MoreBinary Mutation Analysis of Tests Using Reassembleable Disassembly
Navid Emamdoost (University of Minnesota), Vaibhav Sharma (University of Minnesota), Taejoon Byun (University of Minnesota), Stephen McCamant (University of Minnesota)
Read More