School of Computing

Publications by Dr Reuben Rowe

Also view these in the Kent Academic Repository

Conference or workshop item
Rowe, R. and Brotherston, J. (2017). Automatic cyclic termination proofs for recursive procedures in separation logic. in: 6th ACM SIGPLAN Conference on Certified Programs and Proofs. ACM, pp. 53-65. Available at: https://doi.org/10.1145/3018610.3018623.
Rowe, R. and Brotherston, J. (2017). Realizability in Cyclic Proof: Extracting Ordering Information for Infinite Descent. in: TABLEAUX 2017: International Conference on Automated Reasoning with Analytic Tableaux and Related Methods. Springer, pp. 295-310. Available at: http://dx.doi.org/10.1007/978-3-319-66902-1_18.
Brotherston, J. et al. (2016). Model checking for symbolic-heap separation logic with inductive predicates. in: 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL '16. New York, NY, USA: ACM, pp. 84-96. Available at: http://doi.org/10.1145/2914770.2837621.
Rowe, R. (2015). Encoding the Factorisation Calculus. in: EXPRESS/SOS 2015. pp. 76-90. Available at: https://doi.org/10.4204/EPTCS.190.6.
Total publications in KAR: 4 [See all in KAR]

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 11/12/2017