Who am I?

I am a third-year Computer Science PhD student at UCSD working under Loris D’Antoni. My recent work has focused on semantics and verification over infinite sets of programs. In general, I am interested in the use of denotational semantics to define metatheories of program analysis [read this if interested].

I received my BSCS in Computer Science and BS in Math from Rice University in May 2022. While there, I worked with Moshe Vardi on computing partition functions of Ising models.

Publications

Preprints

• [Preprint 24] Semantics of sets of programs. Kim, J.*, Nagy, S.*, Reps, T., & D’Antoni, L. *Equal contribution [link]

Published

• [OOPSLA 24] Automating unrealizability logic: Hoare-style proof synthesis for infinite sets of programs. Nagy, S., Kim, J., D’Antoni, L., & Reps, T. [link]

• [PRE 24] Ising model partition function computation as a weighted counting problem. Nagy, S., Paredes, R., Dudek, J. M., Dueñas-Osorio, L., & Vardi, M. Y. [link]

Awards

UCSD

• NSF Graduate Research Fellowship Awardee [National Science Foundation] (2024)

UW-Madison

• First Year Summer Research Assistantship Award (2023)

Rice University

• Summa cum Laude (CS)/Magna cum Laude (Math) (2022)
• Phi Beta Kappa (2022)
• Louis J. Walsh Engineering Scholarship (2020)

Speaking

Talks

• Hoare-style Proof Synthesis for Infinite Sets of Programs: Automating Unrealizability Logic, OOPSLA, 2024

Lectures

• Program Verification, (Guest Lecture) CS 538: Introduction to Programming Languages, UW-Madison, April 22, 2024
• LR Parsing, (Substitute Lecture) CS 536: Introduction to Programming Languages and Compilers, UW-Madison, March 9, 2023