Satisfiability modulo abstraction for separation logic with linked lists. - Aditya V. Thakur; Jason Breck; Thomas W. Reps (SPIN, 2014)

An Algorithm Inspired by Constraint Solvers to Infer Inductive Invariants in Numeric Programs. - Antoine Miné; Jason Breck; Thomas W. Reps (ESOP, 2016)

Compositional recurrence analysis revisited. - Zachary Kincaid; Jason Breck; Ashkan Forouhi Boroujeni; Thomas W. Reps (PLDI, 2017)

Non-linear reasoning for invariant synthesis. - Zachary Kincaid; John Cyphert; Jason Breck; Thomas W. Reps (Proc. ACM Program. Lang., 2018)

Proving Unrealizability for Syntax-Guided Synthesis. - Qinheping Hu; Jason Breck; John Cyphert; Loris D'Antoni; Thomas W. Reps (CAV (1), 2019)

Refinement of path expressions for static analysis. - John Cyphert; Jason Breck; Zachary Kincaid; Thomas W. Reps (Proc. ACM Program. Lang., 2019)

Closed forms for numerical loops. - Zachary Kincaid; Jason Breck; John Cyphert; Thomas W. Reps (Proc. ACM Program. Lang., 2019)

Templates and recurrences: better together. - Jason Breck; John Cyphert; Zachary Kincaid; Thomas W. Reps (PLDI, 2020)