Formal Verification Engineer

Benefits

Parental leave

Not verified

Non-birth-parent leave

Not verified

Family-building benefits

• Fertility benefits: Not verified
• Adoption assistance: Not verified
• Surrogacy assistance: Not verified

Mental health support

Not verified

Relocation assistance

Not verified

Childcare support

Not verified

Learning budget

Not verified

Verification

Not verified

Salary

Not verified not verified - source not recorded; timestamp not recorded

401(k) match

Not verified not verified - source URL not recorded; timestamp not recorded

Was this benefit information wrong? Tell us.

Schedule

Shift type

Not verified

Weekend work

Not verified

Application

Cover letter

Not verified

Assessment

Not verified

Deadline

Not stated

Where they hire

State eligibility is not yet verified.

About this role

Formal Verification Engineer Mountain View, CA What MatX Is Building MatX's mission is to make the world's best AI models run as efficiently as allowed by physics, bringing the world years ahead in AI quality and availability. We build the full stack-from silicon and rack design through compilers, kernels, and ML models. We are seeking a Formal Verification Engineer to bring rigorous mathematical guarantees to our hardware and software at every layer of the stack. What You'll Do Here - Apply model checking and formal property verification to RTL blocks, memory subsystems, and interconnects, providing complete coverage wherever possible, using tools such as JasperGold or VC-Formal. - Develop and maintain machine-checked proofs for critical compiler transformations, ensuring correctness of lowering passes from our high-level programming model down to hardware - Build embeddings of our hardware description languages and simulator models into interactive theorem provers (e.g. Lean 4, Rocq, Isabelle/HOL), and use those embeddings to prove functional correctness and microarchitectural properties directly against the designs - Collaborate with architecture, compiler, and silicon verification teams to identify correctness properties worth proving and translate them into tractable proof obligations - Drive methodology for integrating formal tools (JasperGold, SymbiYosys, or equivalent) into our existing practices Who You Are - Hands-on experience with hardware model checking-writing SVA/PSL properties, running bounded or unbounded proofs, and closing out formal verification targets at block or subsystem level - Practical experience with at least one interactive theorem prover (Lean, Coq, Isabelle/HOL, Agda, or similar) - Experience embedding an existing

Read the full description at job-boards.greenhouse.io. FewerJobs shows a source-linked preview and links to the original posting.