Computer Science Colloquium
Electrical Engineering and Computer Sciences, University of California, Berkeley
Integrating an AIG Package, Simulator and SAT SolverMon 15.10.2018, 12:00, 45 minutes
JKU, Science Park 3, Raum 218
AbstractThis 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.
BioAlan 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.
Invited by Prof. Dr. Armin Biere
The Computer Science Colloquium is organized by the Department of Coputer Science at JKU, the Österreichische Gesellschaft für Informatik (ÖGI) and the Österreichische Computergesellschaft (OCG).