I am a fifth-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, with applications in code generation and compiler verification.
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.
[Preprint] Unrealizability for Trace Properties. Nagy, S., Lin, A., & D'Antoni, L.
[Preprint] PieceByPiece: Synthesizing Test Generators from Predicates. Peng, X.*, Nagy, S.*, & D'Antoni, L. *Equal contribution
[POPL 26] ChopChop: a programmable framework for semantically constraining the output of language models. Nagy, S.*, Zhou, T.*, Polikarpova, N., & D'Antoni, L. *Equal contribution [paper][code]
[OOPSLA 25] Semantics of sets of programs. Kim, J.*, Nagy, S.*, Reps, T., & D’Antoni, L. *Equal contribution [paper][slides(pdf)][slides(pptx)]
[OOPSLA 24] Automating unrealizability logic: Hoare-style proof synthesis for infinite sets of programs. Nagy, S., Kim, J., D’Antoni, L., & Reps, T. [paper][code][slides(pdf)][slides(pptx)]
[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. [paper][code]