2 citations · 5 across the 5 of their papers we have counts for
5 papers
The Next 700 Program Transformers
Geoffrey Hamilton
In this paper, we describe a hierarchy of program transformers in which the transformer at each level of the hierarchy builds on top of those at lower levels. The program transform…
Distilling Programs to Prove Termination
G. W. Hamilton
The problem of determining whether or not any program terminates was shown to be undecidable by Turing, but recent advances in the area have allowed this information to be determin…
Generating Loop Invariants for Program Verification by Transformation
G. W. Hamilton
Loop invariants play a central role in the verification of imperative programs. However, finding these invariants is often a difficult and time-consuming task for the programmer. W…
Program Transformation to Identify List-Based Parallel Skeletons
Venkatesh Kannan, G. W. Hamilton
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 l…
Generating Counterexamples for Model Checking by Transformation
G. W. Hamilton
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 a…