As of 2017, I'm working in Sanjit Seshia's research group. My work focuses on algorithmic improvisation, as well as the theory and applications of model counting and uniform generation.

## Recent Work

Daniel J. Fremont, Alexandre Donzé, and Sanjit A. Seshia. Control Improvisation. arXiv preprint 1704.06319, April 2017. [arXiv version]

Daniel J. Fremont, Markus N. Rabe, and Sanjit A. Seshia. Maximum Model Counting. In Proceedings of the 31st AAAI Conference on Artificial Intelligence, February 2017. [full version]

Rafael Valle, Alexandre Donzé, Daniel J. Fremont, Ilge Akkaya, Sanjit A. Seshia, Adrian Freed, and David Wessel. Specification Mining for Machine Improvisation with Formal Specifications. In Computers in Entertainment, Vol. 14, No. 3, December 2016. [doi]

Nathan Mull, Daniel J. Fremont, and Sanjit A. Seshia. On the Hardness of SAT with Community Structure. In Proceedings of the 19th International Conference on Theory and Applications of Satisfiability Testing (SAT), July 2016. [full version]

Ilge Akkaya, Daniel J. Fremont, Rafael Valle, Alexandre Donzé, Edward A. Lee, and Sanjit A. Seshia. Control Improvisation with Probabilistic Temporal Specifications. In Proceedings of the 1st International Conference on Internet-of-Things Design and Implementation (IoTDI), April 2016. (best paper award) [arXiv version]

Kuldeep S. Meel, Moshe Vardi, Supratik Chakraborty, Daniel J. Fremont, Sanjit A. Seshia, Dror Fried, Alexander Ivrii, and Sharad Malik. Constrained Sampling and Counting: Universal Hashing Meets SAT Solving. In Proceedings of the AAAI-16 Workshop on Beyond NP, February 2016. [arXiv version]

Daniel J. Fremont, Alexandre Donzé, Sanjit A. Seshia, and David Wessel. Control Improvisation. In Proceedings of the 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), December 2015. (N.B. This preliminary version of the Control Improvisation paper has been substantially extended: see the 2017 version above.) [arXiv version]

Supratik Chakraborty, Daniel J. Fremont, Kuldeep S. Meel, Sanjit A. Seshia, and Moshe Y. Vardi. On Parallel Scalable Uniform SAT Witness Generation. In Proceedings of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), April 2015.

Supratik Chakraborty, Daniel J. Fremont, Kuldeep S. Meel, Sanjit A. Seshia, and Moshe Y. Vardi. Distribution-Aware Sampling and Weighted Model Counting for SAT. In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI), July 2014. [arXiv version]

Daniel J. Fremont and Sanjit A. Seshia. Speeding Up SMT-Based Quantitative Program Analysis. In Proceedings of the 12th International Workshop on Satisfiability Modulo Theories (SMT), July 2014. [arXiv version]

## Older Work

In the summer of 2012 I did a UROP, advised by Henry Cohn. The original topic was the computability of Newton fractals, but my research took a tangent into reachability under affine functions on the integers and related problems. I talked about my work at the RP12 workshop - you can find my slides here. A writeup of my results is available on the arXiv.

In the spring of 2012 I did a UROP with Shankar Raman on the history of notions of continuity and the infinite in mathematics and philosophy. My research was mostly on Cavalieri's theory of indivisibles, Leibniz's various theories on the composition of the continuum, and the early development of set theory.

In the summer of 2011 I did a UROP on tetrahedral numbers, advised by Abhinav Kumar. Most of my time was spent learning about the circle method, which unfortunately seems unlikely to be of much use in proving Pollock's conjecture that every positive integer is the sum of at most 5 tetrahedral numbers. The current best result, by G. L. Watson in 1952 (*Sums of eight values of a cubic polynomial*, in J. London Math. Soc.) using an *ad hoc* method, is that 8 tetrahedral numbers suffice.