Website Maintenance Alert
Due to scheduled maintenance, the USENIX website may not be available on Monday, March 17, from 10:00 am–6:00 pm Pacific Daylight Time (UTC -7). We apologize for the inconvenience and thank you for your patience.
If you would like to register for NSDI '25, SREcon25 Americas, or PEPR '25, please complete your registration before or after this time period.
Nestan is a Postdoctoral Researcher at the Department of Computer Science at the University of California, Santa Barbara. Her research interests include Automated Reasoning, Satisfiability Modulo Theories, Formal Verification, and Security. Her current work focuses on developing symbolic analysis techniques and tools for automatic identification of vulnerabilities in Java bytecode. Previously she worked on developing techniques to aid checking of software security properties, automating solving of string constraints; and on automated reverse engineering of integrated circuits for security analysis.
She was a Postdoctoral Researcher and a Visiting Assistant Professor at the University of Iowa and a Postdoctoral Researcher at Princeton University.
She received a PhD in Computer Science from the University of Manchester, United Kingdom. Her dissertation presented a novel approach for Linear Programing—the Conflict Resolution method.
