default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeoff W. Hamilton
Person information
- affiliation: Dublin City University, Ireland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c38]Geoff W. Hamilton
, Benjamin Aziz:
Excommunication: Transforming π-Calculus Specifications to Remove Internal Communication. SBMF 2022: 109-123- [e2]Geoffrey William Hamilton, Temesghen Kahsai, Maurizio Proietti:
Proceedings 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation, HCVS/VPT@ETAPS 2022, and 10th International Workshop on Verification and Program TransformationMunich, Germany, 3rd April 2022. EPTCS 373, 2022 [contents] - 2021
- [j11]Amir M. Ben-Amram, Geoff W. Hamilton:
Tight Polynomial Bounds for Loop Programs in Polynomial Space. Log. Methods Comput. Sci. 17(4) (2021) - [c37]Geoff W. Hamilton:
The Next 700 Program Transformers. LOPSTR 2021: 113-134 - [i3]Geoffrey William Hamilton:
The Next 700 Program Transformers. CoRR abs/2108.11347 (2021) - 2020
- [j10]Amir M. Ben-Amram, Geoff W. Hamilton:
Tight Polynomial Worst-Case Bounds for Loop Programs. Log. Methods Comput. Sci. 16(2) (2020) - [c36]Geoff W. Hamilton:
Distilling Programs to Prove Termination. VPT/HCVS@ETAPS 2020: 140-154 - [i2]Amir M. Ben-Amram, Geoff W. Hamilton:
Tight Polynomial Bounds for Loop Programs in Polynomial Space. CoRR abs/2010.02823 (2020)
2010 – 2019
- 2019
- [c35]Amir M. Ben-Amram, Geoff W. Hamilton:
Tight Worst-Case Bounds for Polynomial Loop Programs. FoSSaCS 2019: 80-97 - [i1]Amir M. Ben-Amram, Geoff W. Hamilton:
Tight Polynomial Worst-Case Bounds for Loop Programs. CoRR abs/1906.10047 (2019) - 2018
- [j9]Venkatesh Kannan, Geoff W. Hamilton:
Functional Program Transformation for Parallelisation Using Skeletons. Int. J. Parallel Program. 46(1): 152-172 (2018) - 2017
- [c34]Geoff W. Hamilton:
Generating Loop Invariants for Program Verification by Transformation. VPT@ETAPS 2017: 36-53 - 2016
- [c33]Venkatesh Kannan, Geoff W. Hamilton:
Program Transformation to Identify Parallel Skeletons. PDP 2016: 486-494 - [c32]Geoff W. Hamilton:
Generating Counterexamples for Model Checking by Transformation. VPT@ETAPS 2016: 65-82 - [c31]Venkatesh Kannan, Geoff W. Hamilton:
Program Transformation to Identify List-Based Parallel Skeletons. VPT@ETAPS 2016: 118-136 - [e1]Geoff W. Hamilton, Alexei Lisitsa, Andrei P. Nemytykh:
Proceedings of the Fourth International Workshop on Verification and Program Transformation, VPT@ETAPS 2016, Eindhoven, The Netherlands, 2nd April 2016. EPTCS 216, 2016 [contents] - 2015
- [c30]Geoff W. Hamilton:
Verifying Temporal Properties of Reactive Systems by Transformation. VPT@ETAPS 2015: 33-49 - 2014
- [j8]Benjamin Aziz, Geoff W. Hamilton:
Enforcing Reputation Constraints on Business Process Workflows. J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl. 5(1): 101-121 (2014) - [c29]Geoff W. Hamilton, Morten Heine Sørensen:
Local Driving in Higher-Order Positive Supercompilation via the Omega-theorem. VPT@CAV 2014: 36-51 - [c28]Michael Dever, Geoff W. Hamilton:
Automatically Partitioning Data to Facilitate the Parallelization of Functional Programs. Ershov Memorial Conference 2014: 59-66 - [c27]Neil D. Jones, Geoff W. Hamilton:
Asymptotic Speedups, Bisimulation and Distillation (Work in Progress). Ershov Memorial Conference 2014: 177-185 - 2013
- [c26]Benjamin Aziz, Geoff W. Hamilton:
Reputation-Controlled Business Process Workflows. ARES 2013: 42-51 - [c25]Geoff W. Hamilton:
On the Termination of Positive Supercompilation. VPT@CAV 2013: 42-56 - 2012
- [c24]Geoffrey William Hamilton, Neil D. Jones:
Distillation with labelled transition systems. PEPM 2012: 15-24 - 2011
- [j7]Benjamin Aziz, Geoff W. Hamilton:
Verifying a delegation protocol for grid systems. Future Gener. Comput. Syst. 27(5): 476-485 (2011) - [c23]Geoff W. Hamilton, Neil D. Jones:
Proving the Correctness of Unfold/Fold Program Transformations Using Bisimulation. Ershov Memorial Conference 2011: 153-169 - 2010
- [c22]Gavin Mendel-Gleason, Geoff W. Hamilton:
Cyclic Proofs and Coinductive Principles. PAR@ITP 2010: 107-113
2000 – 2009
- 2009
- [c21]Geoff W. Hamilton:
Extracting the Essence of Distillation. Ershov Memorial Conference 2009: 151-164 - [c20]Benjamin Aziz, Geoff W. Hamilton:
Detecting Man-in-the-Middle Attacks by Precise Timing. SECURWARE 2009: 81-86 - 2007
- [j6]Benjamin Aziz, Geoff W. Hamilton:
Modelling and Analysis of PKI-Based Systems Using Process Calculi. Int. J. Found. Comput. Sci. 18(3): 593-618 (2007) - [c19]Geoff W. Hamilton:
Distillation: extracting the essence of programs. PEPM 2007: 61-70 - [c18]Geoff W. Hamilton:
Distilling Programs for Verification. COCV@ETAPS 2007: 17-32 - 2006
- [j5]Geoff W. Hamilton:
Higher Order Deforestation. Fundam. Informaticae 69(1-2): 39-61 (2006) - 2005
- [j4]Benjamin Aziz, Geoff W. Hamilton, David Gray:
A static analysis of cryptographic processes: the denotational approach. J. Log. Algebraic Methods Program. 64(2): 285-320 (2005) - [c17]Benjamin Aziz, David Gray, Geoff W. Hamilton:
A Static Analysis of PKI-Based Systems. ICTCS 2005: 51-65 - [c16]Bernadette Power, Geoff W. Hamilton:
Declassification: Transforming Java Programs to Remove Intermediate Classes. SCAM 2005: 183-192 - [c15]Geoff W. Hamilton:
Poitín: Distilling Theorems From Conjectures. Calculemus 2005: 143-160 - 2004
- [c14]David Sinclair, David Gray, Geoff W. Hamilton:
Synthesising Attacks on Cryptographic Protocols. ATVA 2004: 49-63 - 2003
- [c13]Benjamin Aziz, Geoff W. Hamilton, David Gray:
A Denotational Approach to the Static Analysis of Cryptographic Processes. SVV@ICLP 2003: 19-36 - 2001
- [c12]Benjamin Aziz, Geoff W. Hamilton:
A Denotational Semantics for the Pi-Calculus. IWFM 2001 - [c11]Geoff W. Hamilton:
Extending Higher-Order Deforestation: Transforming Programs to Eliminate Even More Trees. Scottish Functional Programming Workshop 2001: 25-36 - 2000
- [j3]Geoff W. Hamilton:
Composing fair objects. ACIS Int. J. Comput. Inf. Sci. 1(3): 134-144 (2000) - [c10]J. Paul Gibson, Geoff W. Hamilton, Dominique Méry:
A Taxonomy for Triggered Interactions Using Fair Object Semantics. FIW 2000: 193-209 - [c9]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: E104-E110
1990 – 1999
- 1999
- [c8]J. Paul Gibson, Geoff W. Hamilton, Dominique Méry:
Integration Problems in Telephone Feature Requirements. IFM 1999: 129-148 - [c7]David Gray, Geoff W. Hamilton, David Sinclair, J. Paul Gibson, James F. Power:
Four Logics and a Protocol. IWFM 1999 - 1998
- [j2]Pearl Brereton, David Budgen, Geoff W. Hamilton:
Hypertext: The Next Maintenance Mountain. Computer 31(12): 49-55 (1998) - [j1]Geoff W. Hamilton:
Usage Counting Analysis for Lazy Functional Languages. Inf. Comput. 146(2): 100-137 (1998) - 1996
- [c6]Geoff W. Hamilton:
Higher Order Deforestation. PLILP 1996: 213-227 - 1995
- [c5]Geoff W. Hamilton:
Compile-Time Garbage Collection for Lazy Functional Languages. IWMM 1995: 119-144 - 1993
- [b1]Geoffrey William Hamilton:
Compile-time optimisation of store usage in lazy functional programs. University of Stirling, UK, 1993 - 1992
- [c4]Geoff W. Hamilton:
Sharing Analysis of Lazy First-Order Functional Programs. WSA 1992: 68-78 - 1991
- [c3]Geoff W. Hamilton, Simon B. Jones:
Extending Deforestation for First Order functional Programs. Functional Programming 1991: 134-145 - [c2]Geoff W. Hamilton, Simon B. Jones:
Transforming Programs to Eliminate Intermediate Structures. JTASPEFT/WSA 1991: 182-188 - 1990
- [c1]Geoff W. Hamilton, Simon B. Jones:
Compile-Time Garbage Collection by Necessity Analysis. Functional Programming 1990: 66-70
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
