Travelled to:1 × Australia
1 × Belgium
1 × Germany
1 × Italy
Collaborated with:A.Bundy A.Smaill P.Janicic R.Monroy J.Richardson A.Armando L.A.Dennis P.Madden J.Hesketh
Talks about:proof (4) plan (4) program (2) automat (2) use (2) generalis (1) framework (1) techniqu (1) synthesi (1) procedur (1)
Person: Ian Green
DBLP: Green:Ian
Contributed to:
1999
1998199819971997
1993Wrote 6 papers:
- CADE-1999-JanicicBG #flexibility #framework #integration #proving #theorem proving
- A Framework for the Flexible Integration of a Class of Decision Procedures into Theorem Provers (PJ, AB, IG), pp. 127–141.
- ASE-1998-MonroyBG #equation #verification
- Planning Equational Verification in CCS (RM, AB, IG), pp. 43–52.
- CADE-1998-RichardsonSG #higher-order #logic #proving #theorem proving
- System Description: Proof Planning in Higher-Order Logic with Lambda-Clam (JR, AS, IG), pp. 129–133.
- ASE-1997-ArmandoSG #automation #paradigm #recursion #source code #synthesis
- Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm (AA, AS, IG), pp. 2–9.
- CADE-1997-DennisBG #bisimulation #induction #proving #using
- Using A Generalisation Critic to Find Bisimulations for Coinductive Proofs (LAD, AB, IG), pp. 276–290.
- LOPSTR-1993-MaddenHGB #automation #generative #performance #proving #source code #theorem proving #using
- A General Technique for Automatically Generating Efficient Programs Through the Use of Proof Planning (PM, JH, IG, AB), pp. 64–66.