Neta Elad

I am a PhD candidate in the Programming Languages group at Blavatnik's School of Computer Science in Tel Aviv University, advised by Prof. Sharon Shoham and Prof. Mooly Sagiv. My research interests are Formal Methods and Software Verification, particularly using uninterpreted first-order logic to model and verify unbounded computer programs and distributed systems.

Email: [first name][last name] at mail dot [university initials] dot ac dot il.

Publications

Axe 'Em: Eliminating Spurious States with Induction Axioms 2025
Neta Elad, Sharon Shoham. [POPL 2025] [arXiv] [artifact] [slides]
An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification 2024 Distinguished Paper
Neta Elad, Oded Padon, Sharon Shoham. [POPL 2024] [arXiv] [artifact] [video] [slides]
Summing Up Smart Transitions 2021
Neta Elad, Sophie Rain, Neil Immerman, Laura Kovács, Mooly Sagiv. [CAV 2021] [arXiv]

Teaching

Logic for Computer Science Fall 2024
Tel Aviv University, course no. 0368-2170.
Logic for Computer Science Fall 2023
Tel Aviv University, course no. 0368-2170.
Logic for Computer Science Fall 2022
Tel Aviv University, course no. 0368-2170.
Logic for Computer Science Fall 2021
Tel Aviv University, course no. 0368-2170.
Logic and Set Theory for Computer Science Spring 2014
Technion (Israel Institute of Technology), course no. 234293.
Logic and Set Theory for Computer Science Fall 2013
Technion (Israel Institute of Technology), course no. 234293.
Introduction to Systems Programming Spring 2013
Technion (Israel Institute of Technology), course no. 234124.
Introduction to Systems Programming Fall 2012
Technion (Israel Institute of Technology), course no. 234124.

M.Sc. Thesis

First-Order Reasoning about Unbounded Sums with Applications to Safety Properties of ERC-20 Tokens under the supervision of Prof. Mooly Sagiv and Prof. Sharon Shoham (submitted October 2019).