Semantic predicate types and approximation for class-based object oriented programming. - Steffen van Bakel; Reuben N. S. Rowe (FTfJP@ECOOP, 2009)

Safe, Flexible Recursive Types for Featherweight Java. - Reuben N. S. Rowe (ICCSW, 2011)

Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming - (Extended Abstract). - Reuben N. S. Rowe; Steffen van Bakel (TLCA, 2011)

Functional Type Assignment for Featherweight Java - To Rinus Plasmeijer, in Honour of His 61st Birthday. - Steffen van Bakel; Reuben N. S. Rowe (The Beauty of Functional Code, 2013)

Semantic types for class-based objects. - Reuben N. S. Rowe (2013)

Semantic Types and Approximation for Featherweight Java. - Reuben N. S. Rowe; Steffen van Bakel (Theor. Comput. Sci., 2014)

Encoding the Factorisation Calculus. - Reuben N. S. Rowe (EXPRESS/SOS, 2015)

Model checking for symbolic-heap separation logic with inductive predicates. - James Brotherston; Nikos Gorogiannis; Max I. Kanovich; Reuben Rowe (POPL, 2016)

Automatic cyclic termination proofs for recursive procedures in separation logic. - Reuben N. S. Rowe; James Brotherston (CPP, 2017)

Realizability in Cyclic Proof: Extracting Ordering Information for Infinite Descent. - Reuben N. S. Rowe; James Brotherston (TABLEAUX, 2017)

Size Relationships in Abstract Cyclic Entailment Systems. - Reuben N. S. Rowe; James Brotherston (CoRR, 2017)

Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent. - Liron Cohen 001; Reuben N. S. Rowe (CSL, 2018)

A Functional Perspective on Machine Learning via Programmable Induction and Abduction. - Steven Cheung; Victor Darvariu; Dan R. Ghica; Koko Muroya; Reuben N. S. Rowe (FLOPS, 2018)

Infinitary and Cyclic Proof Systems for Transitive Closure Logic. - Liron Cohen 001; Reuben N. S. Rowe (CoRR, 2018)

Rotor: a tool for renaming values in OCaml's module system. - Reuben N. S. Rowe; Hugo Férée; Simon J. Thompson; Scott Owens (IWOR@ICSE, 2019)

Characterising renaming within OCaml's module system: theory and implementation. - Reuben N. S. Rowe; Hugo Férée; Simon J. Thompson; Scott Owens (PLDI, 2019)

A Non-wellfounded, Labelled Proof System for Propositional Dynamic Logic. - Simon Docherty; Reuben N. S. Rowe (TABLEAUX, 2019)

Towards automated reasoning in Herbrand structures. - Liron Cohen 001; Reuben N. S. Rowe; Yoni Zohar (J. Log. Comput., 2019)

Integrating Induction and Coinduction via Closure Operators and Proof Cycles. - Liron Cohen 001; Reuben N. S. Rowe (IJCAR (1), 2020)

Non-well-founded Proof Theory of Transitive Closure Logic. - Liron Cohen 001; Reuben N. S. Rowe (ACM Trans. Comput. Log., 2020)

Deductive Synthesis of Programs with Pointers: Techniques, Challenges, Opportunities - (Invited Paper). - Shachar Itzhaky; Hila Peleg; Nadia Polikarpova; Reuben N. S. Rowe; Ilya Sergey (CAV (1), 2021)

Cyclic program synthesis. - Shachar Itzhaky; Hila Peleg; Nadia Polikarpova; Reuben N. S. Rowe; Ilya Sergey (PLDI, 2021)

The Complex(ity) Landscape of Checking Infinite Descent. - Liron Cohen 001; Adham Jabarin; Andrei Popescu 001; Reuben N. S. Rowe (Proc. ACM Program. Lang., 2024)

Cyclone: A Heterogeneous Tool for Verifying Infinite Descent. - Liron Cohen 001; Reuben N. S. Rowe; Matan Shaked (TACAS (1), 2025)