Publications

You can also find my articles on my Google Scholar profile.

Conference Papers


LoCalMem: Type-Directed Adaptive Serialization for Location- and Content-Addressable Memory

Published in ICFP 2026, 2026

Formalizes Gibbon’s adaptive serialization, with mechanized soundness and locality proofs in Rocq and Lean.

Recommended citation: Michael Rainey, Michael H. Borkowski, Michael Vollmer, Chaitanya S. Koparkar, Mikah Kainen, Vidush Singhal. (2026). "LoCalMem: Type-Directed Adaptive Serialization for Location- and Content-Addressable Memory." Proceedings of the ACM on Programming Languages, 10(ICFP), 461–493.
Download Paper

Optimizing Layout of Recursive Datatypes with Marmoset

Published in ECOOP 2024, 2024

Compiler passes that optimize the memory layout of recursive algebraic datatypes, yielding speedups of 1.14x to 54x.

Recommended citation: Vidush Singhal, Chaitanya Koparkar, Joseph Zullo, Artem Pelenitsyn, Michael Vollmer, Mike Rainey, Ryan Newton, Milind Kulkarni. (2024). "Optimizing Layout of Recursive Datatypes with Marmoset: Or, Algorithms + Data Layouts = Efficient Programs." ECOOP 2024, LIPIcs vol. 313, 38:1–38:28.
Download Paper

Garbage Collection for Mostly Serialized Heaps

Published in ISMM 2024, 2024

Garbage collection techniques for heaps that are mostly densely serialized.

Recommended citation: Chaitanya S. Koparkar, Vidush Singhal, Aditya Gupta, Mike Rainey, Michael Vollmer, Artem Pelenitsyn, Sam Tobin-Hochstadt, Milind Kulkarni, Ryan R. Newton. (2024). "Garbage Collection for Mostly Serialized Heaps." ISMM 2024.
Download Paper

Cornucopia: A Framework for Feedback Guided Generation of Binaries

Published in ASE 2022, 2022

A fuzzing-based compiler framework that generates diverse binaries to stress-test binary analysis tools.

Recommended citation: Vidush Singhal, Akul Abhilash Pillai, Charitha Saumya, Milind Kulkarni, Aravind Machiry. (2022). "Cornucopia: A Framework for Feedback Guided Generation of Binaries." ASE 2022.
Download Paper

Vectorized Secure Evaluation of Decision Forests

Published in PLDI 2021, 2021

A compiler for vectorized evaluation of decision forests under fully homomorphic encryption.

Recommended citation: Raghav Malik, Vidush Singhal, Benjamin Gottfried, Milind Kulkarni. (2021). "Vectorized Secure Evaluation of Decision Forests." PLDI 2021.
Download Paper

Journal Articles


Orchard: Heterogeneous Parallelism and Fine-grained Fusion for Complex Tree Traversals

Published in ACM TACO, Vol. 21, No. 2, Article 41, 2024

A compiler framework that automatically fuses and parallelizes complex tree traversals.

Recommended citation: Vidush Singhal, Laith Sakka, Kirshanthan Sundararajah, Ryan Newton, Milind Kulkarni. (2024). "Orchard: Heterogeneous Parallelism and Fine-grained Fusion for Complex Tree Traversals." ACM Transactions on Architecture and Code Optimization, 21(2), Article 41.
Download Paper

Preprints


SoCal: A Language for Memory-Layout Factorization of Recursive Datatypes

Published in Preprint, under submission, 2026

A formal language for writing well-typed structure-of-arrays programs over packed algebraic datatypes, with memory-correctness guarantees.

Recommended citation: Vidush Singhal, Mikah Kainen, Artem Pelenitsyn, Michael H. Borkowski, Mike Vollmer, Milind Kulkarni. (2026). "SoCal: A Language for Memory-Layout Factorization of Recursive Datatypes." Preprint, under submission.
Download Paper