Karem Sakallah is an American electrical engineer and computer scientist, a professor at University of Michigan[1] known for his work on computational logic, functional verification, SAT solvers, satisfiability modulo theories, and the Graph automorphism problem.[2][3] He was elevated to the rank of IEEE Fellow in 1998.[4] In 2009, he shared the CAV (Computer Aided Verification) award with eight other individuals "for major advances in creating high-performance Boolean satisfiability solvers."[5] In 2012, Sakallah became an ACM Fellow "for algorithms for Boolean Satisfiability that advanced the state-of-the-art of hardware verification."[6][7]

In 2014, Sakallah help shape the development of the Qatar Computing Research Institute (QCRI) in Doha and supervised the growth of the Cyber Security Research Area.[8]

References

  1. ↑ "Professor Karem Sakllah". University of Michigan Department of EECS. Retrieved July 30, 2023.
  2. ↑ "Talk by Karem Sakallah: Faster Symmetry Discovery using Sparsity of Symmetries". Microsoft Corp. February 27, 2009. Retrieved July 30, 2023.
  3. ↑ "Visiting Researcher: Karen Sakallah". Simons Inst for the Theory of Computing. Retrieved July 30, 2023.
  4. ↑ "Fellows directory". IEEE. Retrieved July 30, 2023.
  5. ↑ "CAV award". International Conference on Computer-Aided Verification. Retrieved July 30, 2023.
  6. ↑ "Award recipients: Karem Sakallah". ACM. Retrieved July 30, 2023.
  7. ↑ List of fellows of the Association for Computing Machinery
  8. ↑ "Karem Sakallah Continues Commitment to Qatar Computing Research Institute". Computer Science and Engineering School, University of Michigan. 3 February 2014. Retrieved 3 December 2015.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.