A Rational Reconstruction and Extension of Recursion Analysis. - Alan Bundy; Frank van Harmelen; Jane Hesketh; Alan Smaill; Andrew Stevens 001 (IJCAI, 1989)

Synthesis and Transfomation of Logic Programs from Constructive, Inductive Proof. - Geraint A. Wiggins; Alan Bundy; Ina Kraan; Jane Hesketh (LOPSTR, 1991)

Experiments with Proof Plans for Induction. - Alan Bundy; Frank van Harmelen; Jane Hesketh; Alan Smaill (J. Autom. Reason., 1991)

Using Middle-Out Reasoning to Control the Synthesis of Tail-Recursive Programs. - Jane Hesketh; Alan Bundy; Alan Smaill (CADE, 1992)

Automated Reasoning with Uncertainties. - Flávio S. Corrêa da Silva; David Stuart Robertson 001; Jane Hesketh (Logic at Work, 1992)

A General Technique for Automatically Generating Efficient Programs Through the Use of Proof Planning (Abstract). - Peter Madden; Jane Hesketh; Ian Green; Alan Bundy (LOPSTR, 1993)

A Recursion Planning Analysis of Inductive Completion. - Richard Barnett; David A. Basin; Jane Hesketh (Ann. Math. Artif. Intell., 1993)

Expressing Program Requirements Using Refinement Lattices. - David Stuart Robertson 001; Jaume Agustí-Cullell; Jane Hesketh; Jordi Levy (Fundam. Informaticae, 1994)

Reliable and accountable system design. - Paul J. Krause; Jane Hesketh; Dave Robertson 001 (Knowl. Eng. Rev., 1997)

Lightweight Formalisation in Support of Requirements Engineering. - Jane Hesketh; David Stuart Robertson 001; Norbert E. Fuchs; Alan Bundy (Autom. Softw. Eng., 1998)