Compile-Time Garbage Collection by Necessity Analysis. - Geoff W. Hamilton; Simon B. Jones (Functional Programming, 1990)

Extending Deforestation for First Order functional Programs. - Geoff W. Hamilton; Simon B. Jones (Functional Programming, 1991)

Transforming Programs to Eliminate Intermediate Structures. - Geoff W. Hamilton; Simon B. Jones (JTASPEFT/WSA, 1991)

Sharing Analysis of Lazy First-Order Functional Programs. - Geoff W. Hamilton (WSA, 1992)

Compile-time optimisation of store usage in lazy functional programs. - Geoffrey William Hamilton (1993)

Compile-Time Garbage Collection for Lazy Functional Languages - Geoff W. Hamilton (IWMM, 1995)

Hypertext: The Next Maintenance Mountain. - Pearl Brereton; David Budgen; Geoff W. Hamilton (Computer, 1998)

Usage Counting Analysis for Lazy Functional Languages. - Geoff W. Hamilton (Inf. Comput., 1998)

Integration Problems in Telephone Feature Requirements. - J. Paul Gibson; Geoff W. Hamilton; Dominique Méry (IFM, 1999)

Four Logics and a Protocol. - David Gray; Geoff W. Hamilton; David Sinclair; J. Paul Gibson; James F. Power (IWFM, 1999)

A Taxonomy for Triggered Interactions Using Fair Object Semantics. - J. Paul Gibson; Geoff W. Hamilton; Dominique Méry (FIW, 2000)

Specifying and Verifying IP with Linear Logic. - David Sinclair; James F. Power; J. Paul Gibson; David Gray; Geoff W. Hamilton (ICDCS Workshop on Distributed System Validation and Verification, 2000)

Composing fair objects. - Geoff W. Hamilton (ACIS Int. J. Comput. Inf. Sci., 2000)

A Denotational Semantics for the Pi-Calculus. - Benjamin Aziz; Geoff W. Hamilton (IWFM, 2001)

Extending Higher-Order Deforestation: Transforming Programs to Eliminate Even More Trees. - Geoff W. Hamilton (Scottish Functional Programming Workshop, 2001)

A Denotational Approach to the Static Analysis of Cryptographic Processes. - Benjamin Aziz; Geoff W. Hamilton; David Gray (SVV@ICLP, 2003)

Synthesising Attacks on Cryptographic Protocols. - David Sinclair; David Gray; Geoff W. Hamilton (ATVA, 2004)

A Static Analysis of PKI-Based Systems. - Benjamin Aziz; David Gray; Geoff W. Hamilton (ICTCS, 2005)

Declassification: Transforming Java Programs to Remove Intermediate Classes. - Bernadette Power; Geoff W. Hamilton (SCAM, 2005)

Poitín: Distilling Theorems From Conjectures. - Geoff W. Hamilton (Calculemus, 2005)

A static analysis of cryptographic processes: the denotational approach. - Benjamin Aziz; Geoff W. Hamilton; David Gray (J. Log. Algebraic Methods Program., 2005)

Higher Order Deforestation. - Geoff W. Hamilton (Fundam. Informaticae, 2006)

Distillation: extracting the essence of programs. - Geoff W. Hamilton (PEPM, 2007)

Distilling Programs for Verification. - Geoff W. Hamilton (COCV@ETAPS, 2007)

Modelling and Analysis of PKI-Based Systems Using Process Calculi. - Benjamin Aziz; Geoff W. Hamilton (Int. J. Found. Comput. Sci., 2007)

Extracting the Essence of Distillation. - Geoff W. Hamilton (Ershov Memorial Conference, 2009)

Detecting Man-in-the-Middle Attacks by Precise Timing. - Benjamin Aziz; Geoff W. Hamilton (SECURWARE, 2009)

Cyclic Proofs and Coinductive Principles. - Gavin Mendel-Gleason; Geoff W. Hamilton (PAR@ITP, 2010)

Proving the Correctness of Unfold/Fold Program Transformations Using Bisimulation. - Geoff W. Hamilton; Neil D. Jones (Ershov Memorial Conference, 2011)

Verifying a delegation protocol for grid systems. - Benjamin Aziz; Geoff W. Hamilton (Future Gener. Comput. Syst., 2011)

Distillation with labelled transition systems. - Geoffrey William Hamilton; Neil D. Jones (PEPM, 2012)

Reputation-Controlled Business Process Workflows. - Benjamin Aziz; Geoff W. Hamilton (ARES, 2013)

On the Termination of Positive Supercompilation. - Geoff W. Hamilton (VPT@CAV, 2013)

Local Driving in Higher-Order Positive Supercompilation via the Omega-theorem. - Geoff W. Hamilton; Morten Heine Sørensen (VPT@CAV, 2014)

Automatically Partitioning Data to Facilitate the Parallelization of Functional Programs. - Michael Dever; Geoff W. Hamilton (Ershov Memorial Conference, 2014)

Asymptotic Speedups, Bisimulation and Distillation (Work in Progress). - Neil D. Jones; Geoff W. Hamilton (Ershov Memorial Conference, 2014)

Enforcing Reputation Constraints on Business Process Workflows. - Benjamin Aziz; Geoff W. Hamilton (J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl., 2014)

Verifying Temporal Properties of Reactive Systems by Transformation. - Geoff W. Hamilton (VPT@ETAPS, 2015)

Program Transformation to Identify Parallel Skeletons. - Venkatesh Kannan; Geoff W. Hamilton (PDP, 2016)

Generating Counterexamples for Model Checking by Transformation. - Geoff W. Hamilton (VPT@ETAPS, 2016)

Program Transformation to Identify List-Based Parallel Skeletons. - Venkatesh Kannan; Geoff W. Hamilton (VPT@ETAPS, 2016)

Generating Loop Invariants for Program Verification by Transformation. - Geoff W. Hamilton (VPT@ETAPS, 2017)

Functional Program Transformation for Parallelisation Using Skeletons. - Venkatesh Kannan; Geoff W. Hamilton (Int. J. Parallel Program., 2018)

Tight Worst-Case Bounds for Polynomial Loop Programs. - Amir M. Ben-Amram; Geoff W. Hamilton (FoSSaCS, 2019)

Distilling Programs to Prove Termination. - Geoff W. Hamilton (VPT/HCVS@ETAPS, 2020)

Tight Polynomial Worst-Case Bounds for Loop Programs. - Amir M. Ben-Amram; Geoff W. Hamilton (Log. Methods Comput. Sci., 2020)

The Next 700 Program Transformers. - Geoff W. Hamilton (LOPSTR, 2021)

Tight Polynomial Bounds for Loop Programs in Polynomial Space. - Amir M. Ben-Amram; Geoff W. Hamilton (Log. Methods Comput. Sci., 2021)

Excommunication: Transforming π-Calculus Specifications to Remove Internal Communication. - Geoff W. Hamilton; Benjamin Aziz (SBMF, 2022)