Geoff W. Hamilton

Publication Activity (10 Years)

Years Active: 1990-2022
Publications (10 Years): 13

Top Topics

Business Process

Top Venues

Ershov Memorial Conference

Log. Methods Comput. Sci.

Publications

Geoff W. Hamilton, Benjamin Aziz
Excommunication: Transforming π-Calculus Specifications to Remove Internal Communication. SBMF (2022)
Geoff W. Hamilton
The Next 700 Program Transformers. LOPSTR (2021)
Amir M. Ben-Amram, Geoff W. Hamilton
Tight Polynomial Bounds for Loop Programs in Polynomial Space. Log. Methods Comput. Sci. 17 (4) (2021)
Amir M. Ben-Amram, Geoff W. Hamilton
Tight Polynomial Bounds for Loop Programs in Polynomial Space. CoRR (2020)
Amir M. Ben-Amram, Geoff W. Hamilton
Tight Polynomial Worst-Case Bounds for Loop Programs. Log. Methods Comput. Sci. 16 (2) (2020)
Geoff W. Hamilton
Distilling Programs to Prove Termination. VPT/HCVS@ETAPS (2020)
Amir M. Ben-Amram, Geoff W. Hamilton
Tight Polynomial Worst-Case Bounds for Loop Programs. CoRR (2019)
Amir M. Ben-Amram, Geoff W. Hamilton
Tight Worst-Case Bounds for Polynomial Loop Programs. FoSSaCS (2019)
Venkatesh Kannan, Geoff W. Hamilton
Functional Program Transformation for Parallelisation Using Skeletons. Int. J. Parallel Program. 46 (1) (2018)
Geoff W. Hamilton
Generating Loop Invariants for Program Verification by Transformation. VPT@ETAPS (2017)
Geoff W. Hamilton
Generating Counterexamples for Model Checking by Transformation. VPT@ETAPS (2016)
Venkatesh Kannan, Geoff W. Hamilton
Program Transformation to Identify Parallel Skeletons. PDP (2016)
Venkatesh Kannan, Geoff W. Hamilton
Program Transformation to Identify List-Based Parallel Skeletons. VPT@ETAPS (2016)
Geoff W. Hamilton
Verifying Temporal Properties of Reactive Systems by Transformation. VPT@ETAPS (2015)
Neil D. Jones, Geoff W. Hamilton
Asymptotic Speedups, Bisimulation and Distillation (Work in Progress). Ershov Memorial Conference (2014)
Benjamin Aziz, Geoff W. Hamilton
Enforcing Reputation Constraints on Business Process Workflows. J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl. 5 (1) (2014)
Michael Dever, Geoff W. Hamilton
Automatically Partitioning Data to Facilitate the Parallelization of Functional Programs. Ershov Memorial Conference (2014)
Geoff W. Hamilton, Morten Heine Sørensen
Local Driving in Higher-Order Positive Supercompilation via the Omega-theorem. VPT@CAV (2014)
Benjamin Aziz, Geoff W. Hamilton
Reputation-Controlled Business Process Workflows. ARES (2013)
Geoff W. Hamilton
On the Termination of Positive Supercompilation. VPT@CAV (2013)
Benjamin Aziz, Geoff W. Hamilton
Verifying a delegation protocol for grid systems. Future Gener. Comput. Syst. 27 (5) (2011)
Geoff W. Hamilton, Neil D. Jones
Proving the Correctness of Unfold/Fold Program Transformations Using Bisimulation. Ershov Memorial Conference (2011)
Gavin Mendel-Gleason, Geoff W. Hamilton
Cyclic Proofs and Coinductive Principles. PAR@ITP (2010)
Benjamin Aziz, Geoff W. Hamilton
Detecting Man-in-the-Middle Attacks by Precise Timing. SECURWARE (2009)
Geoff W. Hamilton
Extracting the Essence of Distillation. Ershov Memorial Conference (2009)
Benjamin Aziz, Geoff W. Hamilton
Modelling and Analysis of PKI-Based Systems Using Process Calculi. Int. J. Found. Comput. Sci. 18 (3) (2007)
Geoff W. Hamilton
Distilling Programs for Verification. Electron. Notes Theor. Comput. Sci. 190 (4) (2007)
Geoff W. Hamilton
Distillation: extracting the essence of programs. PEPM (2007)
Geoff W. Hamilton
Higher Order Deforestation. Fundam. Informaticae 69 (1-2) (2006)
Benjamin Aziz, David Gray, Geoff W. Hamilton
A Static Analysis of PKI-Based Systems. ICTCS (2005)
Benjamin Aziz, Geoff W. Hamilton, David Gray
A Denotational Approach to the Static Analysis of Cryptographic Processes. Electron. Notes Theor. Comput. Sci. 118 (2005)
Geoff W. Hamilton
Poitín: Distilling Theorems From Conjectures. Calculemus (2005)
Benjamin Aziz, Geoff W. Hamilton, David Gray
A static analysis of cryptographic processes: the denotational approach. J. Log. Algebraic Methods Program. 64 (2) (2005)
Bernadette Power, Geoff W. Hamilton
Declassification: Transforming Java Programs to Remove Intermediate Classes. SCAM (2005)
David Sinclair, David Gray, Geoff W. Hamilton
Synthesising Attacks on Cryptographic Protocols. ATVA (2004)
Benjamin Aziz, Geoff W. Hamilton
A Denotational Semantics for the Pi-Calculus. IWFM (2001)
Geoff W. Hamilton
Extending Higher-Order Deforestation: Transforming Programs to Eliminate Even More Trees. Scottish Functional Programming Workshop (2001)
J. Paul Gibson, Geoff W. Hamilton, Dominique Méry
A Taxonomy for Triggered Interactions Using Fair Object Semantics. FIW (2000)
David Sinclair, James F. Power, J. Paul Gibson, David Gray, Geoff W. Hamilton
Specifying and Verifying IP with Linear Logic. ICDCS Workshop on Distributed System Validation and Verification (2000)
Geoff W. Hamilton
Composing fair objects. ACIS Int. J. Comput. Inf. Sci. 1 (3) (2000)
J. Paul Gibson, Geoff W. Hamilton, Dominique Méry
Integration Problems in Telephone Feature Requirements. IFM (1999)
David Gray, Geoff W. Hamilton, David Sinclair, J. Paul Gibson, James F. Power
Four Logics and a Protocol. IWFM (1999)
Pearl Brereton, David Budgen, Geoff W. Hamilton
Hypertext: The Next Maintenance Mountain. Computer 31 (12) (1998)
Geoff W. Hamilton
Usage Counting Analysis for Lazy Functional Languages. Inf. Comput. 146 (2) (1998)
Geoff W. Hamilton
Higher Order Deforestation. PLILP (1996)
Geoff W. Hamilton
Compile-Time Garbage Collection for Lazy Functional Languages IWMM (1995)
Geoff W. Hamilton
Sharing Analysis of Lazy First-Order Functional Programs. WSA (1992)
Geoff W. Hamilton, Simon B. Jones
Transforming Programs to Eliminate Intermediate Structures. JTASPEFT/WSA (1991)
Geoff W. Hamilton, Simon B. Jones
Extending Deforestation for First Order functional Programs. Functional Programming (1991)
Geoff W. Hamilton, Simon B. Jones
Compile-Time Garbage Collection by Necessity Analysis. Functional Programming (1990)