Reuben N. S. Rowe

Orcid: 0000-0002-4271-9078

Affiliations:
  • Royal Holloway University of London, UK
  • University College London (former)


According to our database1, Reuben N. S. Rowe authored at least 23 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Complex(ity) Landscape of Checking Infinite Descent.
Proc. ACM Program. Lang., January, 2024

2021
Cyclic program synthesis.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

Deductive Synthesis of Programs with Pointers: Techniques, Challenges, Opportunities - (Invited Paper).
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020
Non-well-founded Proof Theory of Transitive Closure Logic.
ACM Trans. Comput. Log., 2020

Integrating Induction and Coinduction via Closure Operators and Proof Cycles.
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

2019
Towards automated reasoning in Herbrand structures.
J. Log. Comput., 2019

A Non-wellfounded, Labelled Proof System for Propositional Dynamic Logic.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2019

Characterising renaming within OCaml's module system: theory and implementation.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

Rotor: a tool for renaming values in OCaml's module system.
Proceedings of the 3rd International Workshop on Refactoring, 2019

2018
Infinitary and Cyclic Proof Systems for Transitive Closure Logic.
CoRR, 2018

A Functional Perspective on Machine Learning via Programmable Induction and Abduction.
Proceedings of the Functional and Logic Programming - 14th International Symposium, 2018

Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2017
Size Relationships in Abstract Cyclic Entailment Systems.
CoRR, 2017

Realizability in Cyclic Proof: Extracting Ordering Information for Infinite Descent.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2017

Automatic cyclic termination proofs for recursive procedures in separation logic.
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

2016
Model checking for symbolic-heap separation logic with inductive predicates.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

2015
Encoding the Factorisation Calculus.
Proceedings of the Combined 22th International Workshop on Expressiveness in Concurrency and 12th Workshop on Structural Operational Semantics, 2015

2014
Semantic Types and Approximation for Featherweight Java.
Theor. Comput. Sci., 2014

2013
Semantic types for class-based objects.
PhD thesis, 2013

Functional Type Assignment for Featherweight Java - To Rinus Plasmeijer, in Honour of His 61st Birthday.
Proceedings of the Beauty of Functional Code, 2013

2011
Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming - (Extended Abstract).
Proceedings of the Typed Lambda Calculi and Applications - 10th International Conference, 2011

Safe, Flexible Recursive Types for Featherweight Java.
Proceedings of the 2011 Imperial College Computing Student Workshop, 2011

2009
Semantic predicate types and approximation for class-based object oriented programming.
Proceedings of the 11th International Workshop on Formal Techniques for Java-like Programs, 2009


  Loading...