Showing items related by title, author, creator and subject.

• Proving the correctness of unfold/fold program transformations using bisimulation 

  Hamilton, Geoff W.; Jones, Neil D. (Springer, 2012)

  This paper shows that a bisimulation approach can be used to prove the correctness of unfold/fold program transformation algorithms. As an illustration, we show how our approach can be use to prove the correctness of ...
• Distillation with labelled transition systems 

  Hamilton, Geoff W.; Jones, Neil D. (Association for Computing Machinery, 2012)

  In this paper, we provide an improved basis for the “distillation” program transformation. It is known that superlinear speedups can be obtained using distillation, but cannot be obtained by other earlier automatic ...
• Program transformation to identify list-based parallel skeletons 

  Kannan, Venkatesh; Hamilton, Geoff W. (2016)

  Algorithmic skeletons are used as building-blocks to ease the task of parallel programming by abstracting the details of parallel implementation from the developer. Most existing libraries provide implementations of ...
• Generating counterexamples for model checking by transformation 

  Hamilton, Geoff W. (EPTCS, 2016)

  Counterexamples explain why a desired temporal logic property fails to hold. The generation of counterexamples is considered to be one of the primary advantages of model checking as a verification technique. Furthermore, ...
• Distilling new data types 

  Kannan, Venkatesh; Hamilton, Geoff W. (2016)

  Program transformation techniques are commonly used to improve the e ciency of programs. While many transformation techniques aim to remove ine ciencies in the algorithms used in a program, another source of ine ciency ...