CS master's student in Genoa, research intern at MPI-SWS. I look for races in concurrent programs, and for proofs that there are none. Sometimes both at once.
$ whoami
> sahar ramezani. cs master's @ unige, research intern @ mpi-sws
$ currently_doing
> extending DPOR with timestamps in TraceForge
$ also
> teaching Coq to admit when it does not know
$ uptime
> 3 espressos, 1 admitted lemma, 0 races on purpose
At MPI-SWS, the tool I'm working on is TraceForge, a Rust engine for stateless model checking of distributed systems. The phrase "stateless model checking" sounds harder to explain at parties than it actually is. Short version: run a concurrent program over enough interleavings to be confident the bug is not there, without running all of them.
- Tender Offer System for the oil sector
- Grant Request System for a Ministry of Science
- Oracle Forms and PL/SQL modules across several internal tools
- A project management platform that ended up being sold to a company
Theorem sahar_likes_concurrency : forall p, concurrent p -> exists b, found_by_DPOR b p.
Proof.
intros p Hc.
induction Hc.
- (* base case: trivially fine *)
- (* inductive case: probably fine, it is 2 a.m. *)
Admitted.based in Italy. English C1, Italian B1, German A1. international students' representative at UniGe.




