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 MorePISE: Protocol Inference using Symbolic Execution and Automata Learning
Ron Marcovich, Orna Grumberg, Gabi Nakibly (Technion, Israel Institute of Technology)
Read Moredewolf: Improving Decompilation by leveraging User Surveys
Steffen Enders, Eva-Maria C. Behner, Niklas Bergmann, Mariia Rybalka, Elmar Padilla (Fraunhofer FKIE, Germany), Er Xue Hui, Henry Low, Nicholas Sim (DSO National Laboratories, Singapore)
Read More