Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jane Hesketh
1990 – 1999
- 1998
[j4]Jane Hesketh, David Stuart Robertson, Norbert E. Fuchs, Alan Bundy: Lightweight Formalisation in Support of Requirements Engineering. Autom. Softw. Eng. 5(2): 183-210 (1998)- 1994
- [j3]David Stuart Robertson, Jaume Agustí-Cullell, Jane Hesketh, Jordi Levy: Expressing Program Requirements Using Refinement Lattices. Fundam. Inform. 21(3): 163-182 (1994)
- 1993
- [j2]Richard Barnett, David A. Basin, Jane Hesketh: A Recursion Planning Analysis of Inductive Completion. Ann. Math. Artif. Intell. 8(3-4): 363-381 (1993)
- [c6]David Stuart Robertson, Jaume Agustí-Cullell, Jane Hesketh, Jordi Levy: Expressing Program Requirements Using Refinement Lattices. ISMIS 1993: 245-254
- [c5]Peter Madden, Jane Hesketh, Ian Green, Alan Bundy: A General Technique for Automatically Generating Efficient Programs Through the Use of Proof Planning (Abstract). LOPSTR 1993: 64-66
- 1992
- [c4]Jane Hesketh, Alan Bundy, Alan Smaill: Using Middle-Out Reasoning to Control the Synthesis of Tail-Recursive Programs. CADE 1992: 310-324
- [c3]Flávio S. Corrêa da Silva, David Stuart Robertson, Jane Hesketh: Automated Reasoning with Uncertainties. Logic at Work 1992: 57-79
- 1991
- [j1]Alan Bundy, Frank van Harmelen, Jane Hesketh, Alan Smaill: Experiments with Proof Plans for Induction. J. Autom. Reasoning 7(3): 303-324 (1991)
- [c2]Geraint A. Wiggins, Alan Bundy, Ina Kraan, Jane Hesketh: Synthesis and Transfomation of Logic Programs from Constructive, Inductive Proof. LOPSTR 1991: 27-45
1980 – 1989
- 1989
- [c1]Alan Bundy, Frank van Harmelen, Jane Hesketh, Alan Smaill, Andrew Stevens: A Rational Reconstruction and Extension of Recursion Analysis. IJCAI 1989: 359-365
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:13 CET by the dblp team