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
The hard things about analyzing 1’s and 0’s...
Dr. David Brumley, Carnegie Mellon University - ForAllSecure
Read MoreA Comparative Study of Program Graph Effectiveness for Binary...
Michael Kadoshnikov, Clemente Izurieta, Matthew Revelle (Montana State University)
Read MoreBPA-X: An Architecture-Agnostic Block-Based Points-to Analysis for Stripped Binaries
Bokai Zhang, Monika Santra, Syed Rafiul Hussain, Gang Tan (Pennsylvania State University)
Read More