Integrating an AIG Package, Simulator, and SAT Solver
11:00 - 12:00 noon
Rm 4475, 4/F (Lift 25, 26), Academic Building, HKUST


This talk focuses on SAT sweeping for large problem instances where the interdependence of simulation and Boolean satisfiability (SAT) is critical. A modified AIG data-structure is proposed to optimize the speed of logic manipulation for the problems of this type. Experimental results confirm that the new implementation is faster, compared to the old one, in which runtime and scalability has been a known issue.


Speaker's Biography

Alan Mishchenko graduated from Moscow Institute of Physics and Technology (Moscow, Russia) in 1993 with MS and received his PhD from the Glushkov Institute of Cybernetics (Kiev, Ukraine) in 1997. In 2002, he joined the EECS Department at UC Berkeley, where he is currently a full researcher. Alan’s research interests are in developing computationally efficient methods for synthesis and verification.

11:00 - 12:00 noon
Rm 4475, 4/F (Lift 25, 26), Academic Building, HKUST
Post an event
Campus organizations are invited to add their events to the calendar.