2021

Hamilton, Geoff ORCID: 0000-0001-5954-6444 (2021) The next 700 program transformers. In: International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2021, 7-8 Sept 2021, Tallinn, Estonia. ISBN 978-3-030-98868-5

2020

Hamilton, Geoff ORCID: 0000-0001-5954-6444 (2020) Distilling programs to prove termination. In: 8th International Workshop on Verification and Program Transformation, 25-26 Apr 2020, Dublin, Ireland.

Ben-Amram, Amir M. and Hamilton, Geoff ORCID: 0000-0001-5954-6444 (2020) Tight polynomial worst-case bounds for loop programs. Logical Methods in Computer Science, 16 (2). ISSN 1860-5974

Ben-Amram, Amir M. and Hamilton, Geoff ORCID: 0000-0001-5954-6444 (2020) Tight polynomial worst-case bounds for loop programs. Logical Methods in Computer Science, 16 (2). 4:1-4:39. ISSN 1860-5974

2019

Ben-Amram, Amir M. and Hamilton, Geoff ORCID: 0000-0001-5954-6444 (2019) Tight Worst-Case Bounds for Polynomial Loop Programs. In: International Conference on Foundations of Software Science and Computation Structures, 8-11 April 2019, Prague, Czech Republic. ISBN 978-3-030-17126-1

Ben-Amram, Amir M. and Hamilton, Geoff ORCID: 0000-0001-5954-6444 (2019) Tight polynomial bounds for Loop programs in polynomial space. In: International Conference on Foundations of Software Science and Computation Structures, 8-11 Apr 2019, Prague, Czech Republic. ISBN 978-3-030-17126-1

2007

Hamilton, Geoff ORCID: 0000-0001-5954-6444 (2007) Distilling programs for verification. Electronic Notes in Theoretical Computer Science, 190 (4). pp. 17-32. ISSN 1571-0661

1993

Hamilton, Geoff ORCID: 0000-0001-5954-6444 (1993) Compile-time optimisation of store usage in lazy functional programs. PhD thesis, University of Stirling.