Controller design via adaptive critic and model reference methods. - George G. Lendaris; Roberto A. Santiago; Jay McCarthy; Michael Carroll (IJCNN, 2003)

From Bayesian Notation to Pure Racket via Discrete Measure-Theoretic Probability in λ ZFC. - Neil Toronto; Jay McCarthy (IFL, 2010)

Temporal higher-order contracts. - Tim Disney; Cormac Flanagan; Jay McCarthy (ICFP, 2011)

Computing in Cantor's Paradise with λ ZFC. - Neil Toronto; Jay McCarthy (FLOPS, 2012)

Modeling Asynchronous Message Passing for C Programs. - Everett Morse; Nick Vrvilo; Eric Mercer; Jay McCarthy (VMCAI, 2012)

Proving MCAPI executions are correct using SMT. - Yu Huang; Eric Mercer; Jay McCarthy (ASE, 2013)

Practically Accurate Floating-Point Math. - Neil Toronto; Jay McCarthy (Comput. Sci. Eng., 2014)

Running Probabilistic Programs Backwards. - Neil Toronto; Jay McCarthy; David Van Horn (ESOP, 2015)

Bithoven: Gödel encoding of chamber music and functional 8-bit audio synthesis. - Jay McCarthy (FARM@ICFP, 2016)

Deploying Exploring Computer Science Statewide. - Helen H. Hu; Cecily Heiner; Jay McCarthy (SIGCSE, 2016)

Model-Checking Task Parallel Programs for Data-Race. - Radha Nakade; Eric Mercer; Peter Aldous; Jay McCarthy (NFM, 2018)

Special issue on Trends in Functional Programming 2013/14. - Jurriaan Hage; Jay McCarthy (Comput. Lang. Syst. Struct., 2018)

Demand Control-Flow Analysis. - Kimball Germane; Jay McCarthy; Michael D. Adams 001; Matthew Might (VMCAI, 2019)

Model-checking task-parallel programs for data-race. - Radha Nakade; Eric Mercer; Peter Aldous; Kyle Storey; Benjamin Ogles; Joshua Hooker; Sheridan Jacob Powell; Jay McCarthy (Innov. Syst. Softw. Eng., 2019)

Newly-single and loving it: improving higher-order must-alias analysis with heap fragments. - Kimball Germane; Jay McCarthy (Proc. ACM Program. Lang., 2021)