Schedule (at regular hours, unless otherwise indicated)
Tue Sep 9: Introduction to Automated Software Engineering
Fri Sep 12: Introduction to Automated Software Engineering
Tue Sep 16: Introduction to Automated Software Engineering
Fri Sep 19: Introduction to Automated Software Engineering
Tue Sep 23: Introduction to Automated Software Engineering
Fri Sep 26: Introduction to Deductive Synthesis
Tue Sep 30: Introduction to Deductive Synthesis
Fri Oct 3: Introduction to Deductive Synthesis
Tue Oct 7: Introduction to Deductive Synthesis
Fri Oct 10: Introduction to Deductive Synthesis
Tue Oct 14: Introduction to Inductive Synthesis
Fri Oct 17: Introduction to Inductive Synthesis
Tue Oct 21, at 08:45: Presentation of no-name-yet by Brahim
Wed Oct 22, at 15:45: Presentation of KIDS by Cemal
Fri Oct 31: Introduction to Inductive Synthesis
Fri Nov 14: Introduction to Inductive Synthesis
Tue Nov 18: Introduction to Inductive Synthesis
Wed Nov 19, at 15:45: Presentation of TranSys by Pinar
Fri Nov 21: Introduction to Inductive Synthesis
Tue Nov 25: Introduction to Inductive Synthesis
Wed Nov 26, at 15:45: Presentation of Periwinkle by Jikai
Fri Nov 28: Introduction to Inductive Synthesis
Tue Dec 2, at 08:45: Presentation of Progol by Ali
Wed Dec 3, at 15:45: Presentation of Smart by Tuba
Tue Dec 9, at 08:45: Presentation of DIALOGS by Fazil
Wed Dec 10, at 15:45: Conclusions on Automated Software Engineering
Deadlines
everybody: discuss your slides with me minimum 72hrs before your presentation
Brahim, Cemal, Pinar, Jikai: hand in your term-papers on Monday 1 December
at 5pm
Ali, Tuba: hand in your term-papers on Monday 8 December at 5pm
Fazil: hand in your term-paper on Monday 15 December at 5pm
Assigned Papers
no-name-yet:
Pierre Flener and Kung-Kiu Lau.
Program schemas as steadfast programs, and their usage in deductive
synthesis.
Technical Report (ask me).
KIDS:
Douglas R. Smith.
KIDS: A semiautomatic program development system.
IEEE Transactions on Software Engineering 16(9):1024-1043, September
1990.
TranSys:
Halime Buyukyildiz and Pierre Flener.
Generalized logic program transformation schemas.
In: N.E. Fuchs (ed), Proceedings of LOPSTR'97, pp.124-143.
Lecture Notes in Computer Science, volume 1463. Springer-Verlag, 1998.
Periwinkle:
Ina Kraan, David Basin, and Alan Bundy.
Middle-out reasoning for logic program synthesis.
In D.S. Warren (ed), Proceedings of ICLP'93, pp.441-455.
The MIT Press, 1993.
Progol:
Stephen Muggleton.
Inverse entailment and Progol.
New Generation Computing 13:245-286, 1995.
Smart:
Chowdhury R. Mofizur and Masayuki Numao.
Top-down induction of recursive programs from [a] small number of sparse
examples.
In: L. De Raedt (ed), Advances in ILP, pp.236-253.
IOS Press, 1996.
DIALOGS:
Pierre Flener.
Inductive logic program synthesis with DIALOGS.
In: S. Muggleton (ed), Proceedings of ILP'96, pp.175-198.
Lecture Notes in Artificial Intelligence, volume 1314. Springer-Verlag,
1997.
Guidelines
The presentation sessions are at least 90 minutes long, and are organized
as follows:
-
50 minutes (hard maximum) of actual presentation;
-
10 minutes of break;
-
30 minutes (minimum) of questions and answers.
Read the guidelines
for more details.
Remarks
The Periwinkle, TranSys, Progol, Smart, and
DIALOGS
systems are available. I strongly encourage the presenters to experiment
with these systems. The other systems (no-name-yet and KIDS)
are unfortunately not available.