Guy Katz
Full Professor at The Hebrew University of Jerusalem
Israel
Summary
🤩
Rockstar🎓
Top SchoolGuy Katz is a Full Professor at the Hebrew University of Jerusalem with a decade of professional experience bridging academic research and high-impact software development. His trajectory includes postdoctoral work at Stanford and industry exposure at Google, and he progressed rapidly through academic ranks from Senior Lecturer to Full Professor. Katz contributes to foundational open-source tooling for formal methods, notably improving core reasoning and maintainability in the widely used cvc5 SMT solver by refactoring its equality engine and proof infrastructure. He combines rigorous theoretical expertise with practical backend engineering, focusing on correctness, proof explanation, and modular theory integration. Based in Israel, he blends university leadership with contributions that materially strengthen automated theorem proving used by researchers and engineers worldwide.
10 years of coding experience
10 years of employment as a software developer
Weizmann Institute of Science
Github Skills (10)
theorem-proving10
c-language10
cprogramming-language10
computer-engineering10
smt10
data-structure9
algorithm9
data-structures9
algorithms9
formal-verification8
Programming languages (4)
Github contributions (5)
cvc5/cvc5
Feb 2016 - May 2017
cvc5 is an open-source automatic theorem prover for Satisfiability Modulo Theories (SMT) problems.
Role in this project:
Back-end Developer
Back-end DeveloperContributions:77 commits, 16 PRs, 61 pushes in 1 year 4 months
Contributions summary:Guy made changes to the equality engine within the CVC5 theorem prover, specifically modifying how disequalities are explained and how theory-specific logic is handled within the equality path reconstruction. The modifications involved refactoring and refactoring the core components responsible for disequality explanations and congruence. They also contributed to the proof system, with the incorporation of refactoring the equality engine in order to remove theory-specific logic from equality path reconstruction. These changes likely improved the efficiency or maintainability of the theorem prover's core reasoning capabilities.
proversatisfiabilitysmtproblemssatisfiability-modulo-theories
NeuralNetworkVerification/Marabou
Mar 2017 - Oct 2021
Contributions:205 reviews, 797 commits, 108 PRs in 4 years 7 months
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.