Cayden’s research publications


2024
Verified Substitution Redundancy Checking.
Extending DRAT to SMT.

Notes: The eDRAT project began as an internship project between Hanna, Bruno, Marijn, and myself while I was an intern with the Automated Reasoning Group at AWS during the summer of 2022. Hitarth and Bruno continued to work on the project the next summer. Hitarth gave the research talk.

Formal Verification of the Empty Hexagon Number.

Notes: This project was a Lean formalization of the pen-and-paper + SAT solving result made by my advisor earlier in 2024. I worked mainly with James on the infrastructure around verified encodings, which are a feature of the Trestle project. Mario gave the research talk.

TaSSAT: Transferring and Sharing in SAT.
[ PDF | proceedings | code ]

Notes: A tool paper for work done on “A Linear Weight Transfer for Local Search.”

2023
Verified Encodings for SAT Solving.

Notes: Conference paper of my master’s thesis of very similar name. I have given several versions of this talk, including one at FMCAD, one at CanaDAM 2023, and one at a Dagstuhl seminar on SAT encodings.

A Linear Weight Transfer Rule for Local Search.
[ PDF | proceedings | code ]

Notes: A continuation of work on the Divide and Distribute Fixed Weights (DDFW) algorithm, led by Solimul. See my thesis from 2021.

2022
Verifying SAT Encodings in Lean.
Cayden R. Codel, Marijn J. H. Heule, Jeremy Avigad. Unpublished master's thesis.
[ PDF | slides | code ]
[ BibTex ]

Notes: Unpublished master’s thesis. Completed for the partial fulfillment of a master’s degree in computer science at Carnegie Mellon University. Marijn Heule (chair), Jeremy Avigad, Bryan Parno, committee. This work has been continued in the Trestle project.

2021
A Study of Divide and Distribute Fixed Weights and its Variants.

Notes: Unpublished undergraduate thesis. Completed for the fulfillment of undergraduate honors while at Carnegie Mellon University. My work received runner-up for the Allen Newell Award for Excellence in Undergraduate Research. A shortened version of the thesis was accepted to Pragmatics of SAT 2021, where I gave a talk.

Bipartite Perfect Matching Benchmarks.
[ PDF | slides | code ]
[ BibTex ]

Notes: This work extended a project from a special topics course taught by my advisor, Marijn Heule. The talk at Pragmatics of SAT 2021 was given by my co-author, Joseph Reeves.

2019
MineRL: A Large-Scale Dataset of MInecraft Demonstrations.
The MineRL 2019 Competition on Sample Efficient Reinforcement Learning using Human Priors.
[ BibTex ]

Notes: I worked with the MineRL team for 18 months. While with them, I helped them develop code to allow AI agents to communicate with Minecraft, and I worked on experiment design and the data collection pipeline. The MineRL team has yearly competitions for increasingly harder tasks in the Minecraft video game.