Geoff W. Hamilton

Orcid: 0000-0001-5954-6444

Affiliations:
  • Dublin City University, Ireland


According to our database1, Geoff W. Hamilton authored at least 49 papers between 1990 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Excommunication: Transforming π-Calculus Specifications to Remove Internal Communication.
Proceedings of the Formal Methods: Foundations and Applications - 25th Brazilian Symposium, 2022

2021
Tight Polynomial Bounds for Loop Programs in Polynomial Space.
Log. Methods Comput. Sci., 2021

The Next 700 Program Transformers.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2021

2020
Tight Polynomial Worst-Case Bounds for Loop Programs.
Log. Methods Comput. Sci., 2020

Distilling Programs to Prove Termination.
Proceedings of the Proceedings 8th International Workshop on Verification and Program Transformation and 7th Workshop on Horn Clauses for Verification and Synthesis, 2020

2019
Tight Worst-Case Bounds for Polynomial Loop Programs.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

2018
Functional Program Transformation for Parallelisation Using Skeletons.
Int. J. Parallel Program., 2018

2017
Generating Loop Invariants for Program Verification by Transformation.
Proceedings of the Proceedings Fifth International Workshop on Verification and Program Transformation, 2017

2016
Program Transformation to Identify List-Based Parallel Skeletons.
Proceedings of the Fourth International Workshop on Verification and Program Transformation, 2016

Generating Counterexamples for Model Checking by Transformation.
Proceedings of the Fourth International Workshop on Verification and Program Transformation, 2016

Program Transformation to Identify Parallel Skeletons.
Proceedings of the 24th Euromicro International Conference on Parallel, 2016

2015
Verifying Temporal Properties of Reactive Systems by Transformation.
Proceedings of the Third International Workshop on Verification and Program Transformation, 2015

2014
Enforcing Reputation Constraints on Business Process Workflows.
J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl., 2014

Asymptotic Speedups, Bisimulation and Distillation (Work in Progress).
Proceedings of the Perspectives of System Informatics, 2014

Automatically Partitioning Data to Facilitate the Parallelization of Functional Programs.
Proceedings of the Perspectives of System Informatics, 2014

Local Driving in Higher-Order Positive Supercompilation via the Omega-theorem.
Proceedings of the VPT 2014. Second International Workshop on Verification and Program Transformation, 2014

2013
On the Termination of Positive Supercompilation.
Proceedings of the First International Workshop on Verification and Program Transformation, 2013

Reputation-Controlled Business Process Workflows.
Proceedings of the 2013 International Conference on Availability, Reliability and Security, 2013

2012
Distillation with labelled transition systems.
Proceedings of the ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation, 2012

2011
Verifying a delegation protocol for grid systems.
Future Gener. Comput. Syst., 2011

Proving the Correctness of Unfold/Fold Program Transformations Using Bisimulation.
Proceedings of the Perspectives of Systems Informatics, 2011

2010
Cyclic Proofs and Coinductive Principles.
Proceedings of the Partiality and Recursion in Interactive Theorem Provers, 2010

2009
Detecting Man-in-the-Middle Attacks by Precise Timing.
Proceedings of the Third International Conference on Emerging Security Information, 2009

Extracting the Essence of Distillation.
Proceedings of the Perspectives of Systems Informatics, 2009

2007
Modelling and Analysis of PKI-Based Systems Using Process Calculi.
Int. J. Found. Comput. Sci., 2007

Distilling Programs for Verification.
Proceedings of the Workshop on Compiler Optimization meets Compiler Verification, 2007

Distillation: extracting the essence of programs.
Proceedings of the 2007 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation, 2007

2006
Higher Order Deforestation.
Fundam. Informaticae, 2006

2005
A static analysis of cryptographic processes: the denotational approach.
J. Log. Algebraic Methods Program., 2005

Poitín: Distilling Theorems From Conjectures.
Proceedings of the 12th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, 2005

Declassification: Transforming Java Programs to Remove Intermediate Classes.
Proceedings of the 5th IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2005), 30 September, 2005

A Static Analysis of PKI-Based Systems.
Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2004
Synthesising Attacks on Cryptographic Protocols.
Proceedings of the Automated Technology for Verification and Analysis: Second International Conference, 2004

2003
A Denotational Approach to the Static Analysis of Cryptographic Processes.
Proceedings of the International Workshop on Software Verification and Validation, 2003

2001
Extending Higher-Order Deforestation: Transforming Programs to Eliminate Even More Trees.
Proceedings of the Selected papers from the 3rd Scottish Functional Programming Workshop (SFP01), 2001

A Denotational Semantics for the Pi-Calculus.
Proceedings of the 5th Irish Workshop on Formal Methods, 2001

2000
Composing fair objects.
ACIS Int. J. Comput. Inf. Sci., 2000

Specifying and Verifying IP with Linear Logic.
Proceedings of the 2000 ICDCS Workshops, April 10, 2000, Taipei, Taiwan, ROC, 2000

A Taxonomy for Triggered Interactions Using Fair Object Semantics.
Proceedings of the Feature Interactions in Telecommunications and Software Systems VI, 2000

1999
Four Logics and a Protocol.
Proceedings of the 3rd Irish Workshop on Formal Methods, Galway, Ireland, July 1999, 1999

Integration Problems in Telephone Feature Requirements.
Proceedings of the Integrated Formal Methods, 1999

1998
Usage Counting Analysis for Lazy Functional Languages.
Inf. Comput., 1998

Hypertext: The Next Maintenance Mountain.
Computer, 1998

1995
Compile-Time Garbage Collection for Lazy Functional Languages
Proceedings of the Memory Management, 1995

1993
Compile-time optimisation of store usage in lazy functional programs.
PhD thesis, 1993

1992
Sharing Analysis of Lazy First-Order Functional Programs.
Proceedings of the Actes WSA'92 Workshop on Static Analysis (Bordeaux, 1992

1991
Transforming Programs to Eliminate Intermediate Structures.
Proceedings of the Actes JTASPEFL'91 (Bordeaux, 1991

Extending Deforestation for First Order functional Programs.
Proceedings of the Functional Programming, 1991

1990
Compile-Time Garbage Collection by Necessity Analysis.
Proceedings of the 1990 Glasgow Workshop on Functional Programming, 1990


  Loading...