Tod Amon (Sandia National Laboratories), Tim Loffredo (Sandia National Laboratories)
Creating Human Readable Path Constraints from Symbolic Execution
View More Papers
It Doesn’t Have to Be So Hard: Efficient Symbolic...
Vaibhav Sharma (University of Minnesota), Navid Emamdoost (University of Minnesota), Seonmo Kim (University of Minnesota), Stephen McCamant (University of Minnesota)
Read MoreSn4ke: Practical Mutation Analysis of Tests at Binary Level
Mohsen Ahmadi (Arizona State University), Pantea Kiaei (Worcester Polytechnic Institute), Navid Emamdoost (University of Minnesota)
Read MoreRethink Custom Transformers for Binary Analysis
Heng Yin, Professor, Department of Computer Science and Engineering, University of California, Riverside
Read MoreIs Your Firmware Real or Re-Hosted? A case study...
Abraham A. Clements, Logan Carpenter, William A. Moeglein (Sandia National Laboratories), Christopher Wright (Purdue University)
Read More