World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
54
Citations
11793
World Ranking
4560
National Ranking
2132

Research.com Recognitions

  • 2012 - ACM Fellow For algorithms for Boolean Satisfiability that advanced the state-of-the-art of hardware verification.
  • 1998 - IEEE Fellow For contributions to the modeling, analysis, and optimization of digital system timing.

Overview

Karem A. Sakallah is affiliated with the University of Michigan-Ann Arbor in the United States. Their scholarly work centers predominantly on computer science, with a focus on computational theory and mathematics, artificial intelligence, computer networks and communications, software, and safety, risk, reliability, and quality.

Their main research topics include formal methods in verification, distributed systems and fault tolerance, logic, programming and type systems, software testing and debugging techniques, security and verification in computing, Petri nets in system modeling, and safety systems engineering in autonomy.

Frequent coauthors collaborating with Sakallah include Aman Goel, Denis Bueno, Y. Luo, Stephan Merz, and Arlen Cox.

Recent papers authored or coauthored by Sakallah are:

  • Towards an Automatic Proof of Lamport's Paxos, 2021, arXiv (Cornell University)
  • Regularity and quantification: a new approach to verify distributed protocols, 2022, Innovations in Systems and Software Engineering
  • EUFicient Reachability for Software with Arrays, 2020, reposiTUm (TU Wien)
  • Proceedings 8th International Workshop on Verification and Program Transformation and 7th Workshop on Horn Clauses for Verification and Synthesis, 2020, Electronic Proceedings in Theoretical Computer Science
  • On Symmetry and Quantification: A New Approach to Verify Distributed Protocols, 2021, Zenodo (CERN European Organization for Nuclear Research)

These publications have appeared in various venues including arXiv (Cornell University), Innovations in Systems and Software Engineering, reposiTUm (TU Wien), Electronic Proceedings in Theoretical Computer Science, and Zenodo (CERN European Organization for Nuclear Research).

Sakallah has been recognized as an ACM Fellow in 2012 for contributions related to algorithms for Boolean satisfiability advancing hardware verification. The IEEE Fellow honor was awarded in 1998 for work on modeling, analysis, and optimization of digital system timing.

Best Publications

  • GRASP: a search algorithm for propositional satisfiability

    J.P. Marques-Silva;K.A. Sakallah

  • GRASP—a new search algorithm for satisfiability

    João P. Marques Silva;Karem A. Sakallah

  • Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints

    Mark H. Liffiton;Karem A. Sakallah

  • SATIRE: a new incremental satisfiability engine

    Jesse Whittemore;Joonyoung Kim;Karem Sakallah

  • Efficient symmetry breaking for Boolean satisfiability

    F.A. Aloul;K.A. Sakallah;I.L. Markov

  • Generic ILP versus specialized 0-1 ILP: an update

    Fadi A. Aloul;Arathi Ramani;Igor L. Markov;Karem A. Sakallah

  • A comparative study of two Boolean formulations of FPGA detailed routing constraints

    G.-J. Nam;F. Aloul;K.A. Sakallah;R.A. Rutenbar

  • Analysis and design of latch-controlled synchronous digital circuits

    K.A. Sakallah;T.N. Mudge;O.A. Olukotun

  • Theory and Applications of Satisfiability Testing (SAT 2007)

    João Marques-Silva;Karem A. Sakallah

  • Exploiting structure in symmetry detection for CNF

    Paul T. Darga;Mark H. Liffiton;Karem A. Sakallah;Igor L. Markov

  • Boolean satisfiability in electronic design automation

    João P. Marques-Silva;Karem A. Sakallah

  • CheckT/sub c/ and minT/sub c/: timing verification and optimal clocking of synchronous digital circuits

    K.A. Sakallah;T.N. Mudge;O.A. Olukotun

  • Congestion driven quadratic placement

    Phiroze N. Parakh;Richard B. Brown;Karem A. Sakallah

  • PBS: A Backtrack-Search Pseudo-Boolean Solver and Optimizer

    Fadi A. Aloul;Arathi Ramani;Igor L. Markov;Karem A. Sakallah

  • On finding all minimally unsatisfiable subformulas

    Mark H. Liffiton;Karem A. Sakallah

  • Solving difficult instances of Boolean satisfiability in the presence of symmetry

    F.A. Aloul;A. Ramani;I.L. Markov;K.A. Sakallah

  • Solving difficult SAT instances in the presence of symmetry

    Fadi A. Aloul;Arathi Ramani;Igor L. Markov;Karem A. Sakallah

  • AMUSE: a minimally-unsatisfiable subformula extractor

    Yoonna Oh;Maher N. Mneimneh;Zaher S. Andraus;Karem A. Sakallah

  • Pueblo: A Hybrid Pseudo-Boolean SAT Solver

    Hossein M. Sheini;Karem A. Sakallah

  • Faster symmetry discovery using sparsity of symmetries

    Paul T. Darga;Karem A. Sakallah;Igor L. Markov

  • Theory and applications of satisfiability testing - SAT 2007 : 10th International Conference, Lisbon, Portugal, May 28-31, 2007 : proceedings

    João Marques-Silva;Karem A. Sakallah

Frequent Co-Authors

Igor L. Markov
Igor L. Markov Synopsys (United States)
Joao Marques-Silva
Joao Marques-Silva Institució Catalana de Recerca i Estudis Avançats
Trevor Mudge
Trevor Mudge University of Michigan–Ann Arbor
Richard B. Brown
Richard B. Brown University of Utah
Rob A. Rutenbar
Rob A. Rutenbar University of Pittsburgh
Edward S. Davidson
Edward S. Davidson University of Michigan–Ann Arbor
Jong-Gwan Yook
Jong-Gwan Yook Yonsei University
Linda P. B. Katehi
Linda P. B. Katehi Texas A&M University
Martha E. Pollack
Martha E. Pollack Cornell University
John P. Hayes
John P. Hayes University of Michigan–Ann Arbor

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

If you’re considering a Computer Science degree in the USA, you may also want to explore related fields that offer flexible learning and strong career potential. Many students now opt for online degree programs to save on tuition and fit their studies around other commitments. For those interested in the physical sciences, earning a physics degree online can open up paths in research, education, or engineering.

Data science continues to grow in demand. Pursuing a data scientist degree online is a strategic move, with programs available at various price points. Similarly, technology-driven students can explore electrical engineering online tuition costs to find affordable options in a field closely related to computer science.

For those seeking to quickly enhance their credentials, there are also 3-month certificate programs that pay well. These fast-tracked certificates can lead to lucrative positions in areas like cybersecurity, programming, and IT support, providing rapid entry into the tech workforce.

Best Scientists Citing Karem A. Sakallah

Trending Scientists

Recently Published Articles