Geoff W. Hamilton - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 27 from 27

2022

Excommunication: Transforming π-Calculus Specifications to Remove Internal CommunicationGeoff W. Hamilton, Benjamin Aziz. sbmf 2022: 109-123 [doi]

2021

Tight Polynomial Bounds for Loop Programs in Polynomial SpaceAmir M. Ben-Amram, Geoff W. Hamilton. lmcs, 17(4), 2021. [doi]

The Next 700 Program TransformersGeoff W. Hamilton. LOPSTR 2022: 113-134 [doi]

2020

Tight Polynomial Worst-Case Bounds for Loop ProgramsAmir M. Ben-Amram, Geoff W. Hamilton. lmcs, 16(2), 2020. [doi]

2019

Tight Worst-Case Bounds for Polynomial Loop ProgramsAmir M. Ben-Amram, Geoff W. Hamilton. fossacs 2019: 80-97 [doi]

2018

Functional Program Transformation for Parallelisation Using SkeletonsVenkatesh Kannan, Geoff W. Hamilton. ijpp, 46(1):152-172, 2018. [doi]

2016

Program Transformation to Identify Parallel SkeletonsVenkatesh Kannan, Geoff W. Hamilton. pdp 2016: 486-494 [doi]

2014

Enforcing Reputation Constraints on Business Process WorkflowsBenjamin Aziz, Geoff W. Hamilton. jowua, 5(1):101-121, 2014. [doi]

Asymptotic Speedups, Bisimulation and Distillation (Work in Progress)Neil D. Jones, Geoff W. Hamilton. ershov 2015: 177-185 [doi]

2011

Verifying a delegation protocol for grid systemsBenjamin Aziz, Geoff W. Hamilton. fgcs, 27(5):476-485, 2011. [doi]

Proving the Correctness of Unfold/Fold Program Transformations Using BisimulationGeoff W. Hamilton, Neil D. Jones. ershov 2012: 153-169 [doi]

2010

Cyclic Proofs and Coinductive PrinciplesGavin Mendel-Gleason, Geoff W. Hamilton. itp 2012: 106-112 [doi]

2009

Detecting Man-in-the-Middle Attacks by Precise TimingBenjamin Aziz, Geoff W. Hamilton. securware 2009: 81-86 [doi]

2006

Higher Order DeforestationGeoff W. Hamilton. FUIN, 69(1-2):39-61, 2006. [doi]

2005

2001

A Denotational Semantics for the Pi-CalculusBenjamin Aziz, Geoff W. Hamilton. iwfm 2001: [doi]

2000

Composing fair objectsGeoff W. Hamilton. acisj, 1(3):134-144, 2000. [doi]

1998

Usage Counting Analysis for Lazy Functional LanguagesGeoff W. Hamilton. iandc, 146(2):100-137, 1998.

1996

Higher Order DeforestationGeoff W. Hamilton. plilp 1996: 213-227

1995

Compile-Time Garbage Collection for Lazy Functional LanguagesGeoff W. Hamilton. iwmm 1995: 119-144

1992

Sharing Analysis of Lazy First-Order Functional ProgramsGeoff W. Hamilton. SAS 1992: 68-78

1991

Extending Deforestation for First Order functional ProgramsGeoff W. Hamilton, S. B. Jones. fp 1992: 134-145

Transforming Programs to Eliminate Intermediate StructuresGeoff W. Hamilton, S. B. Jones. SAS 1991: 182-188

1990

Compile-Time Garbage Collection by Necessity AnalysisGeoff W. Hamilton, Simon B. Jones. 1991: 66-70 [doi]

Sign in or sign up to see more results.

runs on WebDSL