Yogev Shalmon Barzel

PhD Student in Formal Verification & SAT Solving

profile_pic_crop.jpg

PhD Student Researcher @ NVIDIA

PhD Student @ Technion

I am a PhD student in the Faculty of Data and Decision Sciences at the Technion — Israel Institute of Technology, advised by Alexander Nadel and Ofer Strichman.

My research focuses on SAT solvers and their applications. These days I am building GPAP, a GPU engine for Boolean constraint propagation:

GPAP logo: a 3x3 grid of purple cells inside a chip die with gold pins
GPAP GPU-Parallel (partial) Assignment Propagation

Boolean constraint propagation on the GPU: thousands of independent partial assignments, each propagated to its own fixpoint in a single kernel launch. A foundation for SAT on the GPU, and an open-source library to build on.

I am currently a PhD Student Researcher at NVIDIA, working in Formal Verification Development alongside my PhD — not a summer internship, but an ongoing student position. Previously, I worked as a research student at Intel Corporation in Haifa, Israel, where my work on Boolean matching (EBat) was productized as part of Intel’s library mapping flow. My work has been published at the International Conference on Theory and Applications of Satisfiability Testing (SAT) and at Formal Methods in Computer-Aided Design (FMCAD), and received the Best Student Paper Award at SAT 2025.

news

Oct 20, 2026 Introducing GPAP: Boolean constraint propagation on the GPU! GPAP propagates thousands of partial assignments at once, in a single kernel launch, and is now open source. Our preprint SAT Sampling at Scale via GPU-based Boolean Constraint Propagation (with Alexander Nadel and Ofer Strichman) builds a SAT sampler on top of it.
Sep 01, 2026 New paper at FMCAD 2026! Our paper NobleCount: Revisiting a Forgotten Data Structure for Local Search in SAT (with Alexander Nadel and Ofer Strichman) appears at the 26th Conference on Formal Methods in Computer-Aided Design (FMCAD 2026). [PDF]
Apr 01, 2026 Joined NVIDIA as PhD Student Researcher! I am excited to join NVIDIA as a PhD Student Researcher in Formal Verification Development — an ongoing position alongside my PhD at the Technion.
Aug 01, 2025 Best Student Paper Award at SAT 2025! Our paper Enumerating All Boolean Matches (with Alexander Nadel) received the Best Student Paper Award at the 28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025). The companion open-source tool EBat is publicly available.
Sep 26, 2024 Exciting News: PhD Acceptance at the Technion! I am thrilled to announce that I have been accepted into the PhD program at the Technion (Israel Institute of Technology) in the Faculty of Data and Decision Sciences. My supervisors are Alexander Nadel and Ofer Strichman.

selected publications

  1. SAT Sampling at Scale via GPU-based Boolean Constraint Propagation
    Alexander Nadel, Yogev Shalmon, and Ofer Strichman
    arXiv preprint arXiv:2610.28805, 2026
    Introduces GPAP, an open-source GPU engine for Boolean constraint propagation
  2. NobleCount: Revisiting a Forgotten Data Structure for Local Search in SAT
    Yogev Shalmon, Alexander Nadel, and Ofer Strichman
    In 26th Conference on Formal Methods in Computer-Aided Design (FMCAD 2026), 2026
  3. Enumerating All Boolean Matches
    Alexander Nadel, and Yogev Shalmon
    In 28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025), 2025
    Best Student Paper Award @ SAT 2025