2000 |
18 | | Raul Monroy,
Alan Bundy,
Ian Green:
Searching for a Solution to Program Verification=Equation Solving in CCS.
MICAI 2000: 1-12 |
17 | | Louise A. Dennis,
Alan Bundy,
Ian Green:
Making a productive use of failure to generate witnesses for coinduction from divergent proof attempts.
Ann. Math. Artif. Intell. 29(1-4): 99-138 (2000) |
16 | | Raul Monroy,
Alan Bundy,
Ian Green:
Planning Proofs of Equations in CCS.
Autom. Softw. Eng. 7(3): 263-304 (2000) |
1999 |
15 | EE | Predrag Janicic,
Alan Bundy,
Ian Green:
A Framework for the Flexible Integration of a Class of Decision Procedures into Theorem Provers.
CADE 1999: 127-141 |
14 | | Jeremy Gow,
Alan Bundy,
Ian Green:
Extensions to the Estimation Calculus.
LPAR 1999: 258-272 |
13 | | Alessandro Armando,
Alan Smaill,
Ian Green:
Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm.
Autom. Softw. Eng. 6(4): 329-356 (1999) |
12 | | Mateja Jamnik,
Alan Bundy,
Ian Green:
On Automating Diagrammatic Proofs of Arithmetic Arguments.
Journal of Logic, Language and Information 8(3): 297-321 (1999) |
1998 |
11 | EE | Raul Monroy,
Alan Bundy,
Ian Green:
Planning Equational Verification in CCS.
ASE 1998: 43-52 |
10 | EE | Julian Richardson,
Alan Smaill,
Ian Green:
System Description: Proof Planning in Higher-Order Logic with Lambda-Clam.
CADE 1998: 129-133 |
9 | | Raul Monroy,
Alan Bundy,
Ian Green:
Observant: An Annotated Term-Rewriting System for Deciding Observation Congruence.
ECAI 1998: 393-397 |
1997 |
8 | EE | Alessandro Armando,
Alan Smaill,
Ian Green:
Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm.
ASE 1997: 2-9 |
7 | | Louise A. Dennis,
Alan Bundy,
Ian Green:
Using A Generalisation Critic to Find Bisimulations for Coinductive Proofs.
CADE 1997: 276-290 |
6 | | Mateja Jamnik,
Alan Bundy,
Ian Green:
Automation of Diagrammatic Reasoning.
IJCAI (1) 1997: 528-533 |
1996 |
5 | | Alan Smaill,
Ian Green:
Higher-Order Annotated Terms for Proof Search.
TPHOLs 1996: 399-413 |
1994 |
4 | | Peter Madden,
Ian Green:
A General Technique for Automatically Optimizing Programs Through the Use of Proof Plans.
AISMC 1994: 64-79 |
3 | | Tetsuya Yoshida,
Alan Bundy,
Ian Green,
Toby Walsh,
David A. Basin:
Coloured Rippling: An Extension of a Theorem Proving Heuristic.
ECAI 1994: 85-89 |
1993 |
2 | | 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 |
1991 |
1 | | Ian Green:
Using Abstraction to Automate Program Improvement by Transformation.
AAAI 1991: 317-322 |