Publications

ISSRE ’26 Sep 2026 · 37th IEEE International Symposium on Software Reliability Engineering (ISSRE 2026)

An Empirical Study of LLM-Generated Specifications for VeriFast

Wen Fan, Minh Tran, Sanya Dod, Xin Hu, Marilyn Rego, Danning Xie, Jenna DiVincenzo, Lin Tan

BibTeX

An extended empirical study evaluating LLM-generated specifications for the VeriFast static verifier, following up on our earlier FORGE 2025 work with a broader set of models and a deeper analysis of specification quality.

NAIC @ SIGCOMM ’26 Aug 2026 · 3rd Workshop on Networks for AI Computing (NAIC) @ ACM SIGCOMM 2026

Towards Network-Efficient Cross-Regional Inference via Learned Activation Compression

Regan McDonald, Marilyn Rego, Ertza Warraich, Annus Zulfiqar, Muhammad Shahbaz

PaperResearchGateBibTeX

Cross-regional LLM inference is bottlenecked by the network cost of shuttling activations between distant data centers. This paper introduces a learned activation-compression approach that reduces that cross-region communication cost while preserving inference quality, enabling more network-efficient multi-region deployment of large models.

FORGE ’25 Apr 2025 · IEEE/ACM FORGE 2025, co-located with ICSE 2025

Evaluating the Ability of GPT-4o to Generate Verifiable Specifications in VeriFast

Marilyn Rego*, Wen Fan*, Xin Hu, Sanya Dod, Zhaorui Ni, Danning Xie, Jenna DiVincenzo, Lin Tan (*equal contribution)

PaperarXivBibTeX

Static verification tools like VeriFast require developers to hand-write formal specifications, which is a major barrier to adoption. This paper evaluates whether GPT-4o can generate fully accurate specifications that VeriFast can verify, progressing from baseline prompt engineering to chain-of-thought (CoT) reasoning, prompt chaining, and few-shot prompting. We categorized the VeriFast benchmark suite, built tailored input datasets for testing, and designed a qualitative analysis methodology to assess output correctness, syntactic validity, and model failure modes — offering an early look at how far off-the-shelf LLMs are from generating machine-checkable proofs.