About • Publications • Full CV

I'm an undergraduate at Northeastern University double-majoring in computer science and mathematics. I'm interested in the formalization and verification of interesting and useful systems, as well as the logical foundations of mathematics and computing. My previous work involves system and network security. I'm thankful to have worked under the various supervisions of Cristina Nita-Rotaru at Northeastern University, Jelena Mirkovic at USC, and Christoph Haase at Oxford.

** indicates equal contribution.*

A Formal Analysis of SCTP: Attack Synthesis and Patch Verification
Can It Edit? Evaluating the Ability of Large Language Models to Follow Code Editing Instructions
Understanding DNS Query Composition at B-Root

Jacob Ginesin*, Max von Hippel*, Evan Defloor, Cristina Nita-Rotaru, Michael Tüxen. USENIX Security 2024.

We use formal methods to analyze the security of the Stream Control Transmission Protocol (SCTP). We report a symphony of new attacks across various attacker models, the automated re-discovery of CVE-2021-3772, and two ambiguities in SCTP RFC that, if misinterpreted, enable attacks.

Federico Cassano, Luisa Li, Akul Sethi, Noah Shinn, Abby Brennan-Jones, Jacob Ginesin, Edward Berman, George Chakhnashvili, Anton Lozhkov, Carolyn Jane Anderson, Arjun Guha. Conference on Language Modeling, 2024.

We develop benchmarks to evaluate large language models on code editing performance, as previous benchmarks proved insufficient. We also fine-tune models for specifically code editing.

Jacob Ginesin, Jelena Mirkovic. IEEE/ACM Conference on Big Data Computing, Applications and Technologies.

We study the validity of traffic at a DNS root server through analyzing historical data.

The Matrix Reloaded: A Mechanized Formal Analysis of the Matrix Cryptographic Suite
SafeLLVM: LLVM Without The ROP Gadgets!

Jacob Ginesin, Cristina Nita-Rotaru. In submission. arXiv preprint arXiv:2408.12743, 2024.

We analyze the cryptographic group instant messaging protocols behind Matrix using ProVerif, comparing them to the standard in the space (WhatsApp, Signal, etc.). We find a few issues.

Federico Cassano, Charles Bershatsky, Jacob Ginesin, Sasha Bashenko. arXiv preprint arXiv:2305.06092, 2023.

A Return-oriented programming attack is when an attacker takes advantage of existing chunks of code in memory, dubbed gadgets, and chains them together to form an attack. We propose an approach to minimize the number of usable gadgets in compiled binaries, extending the methodology of a previous work.

Regular Language Bounds: Extraction and Applications (Poster)

Jacob Ginesin, Christoph Haase. Presented at the Joint Mathematical Meetings 2024.

We define methods to compute the upper and lower boundaries of regular languages in order to speed up model checkers.

Effective Preconditioning for LOBPCG

Jacob Ginesin, Daniel Yu. Product of a 2024 summer undergraduate research program ran by Northeastern University.

When finding the algebraic connectivity of a graph using the Fiedler value, the 2nd smallest eigenvalue of the graph Laplacian, exploiting said graphical structure to precondition the eigensolver (LOBPCG) is somewhat effective.

A Simple Heuristic for Deciding Intersection Non-Emptiness for Regular and ω-Regular Automata

Jacob Ginesin. Product of research done while visiting at Oxford.

We define and implement a simple heuristic for deciding the intersection non-emptiness problem for regular and ω-regular automata