| || ||
This seminar looks at configuration of software at compile
and run time. At compile time, configuration is concerned
with selecting the right modules for compilation and linking,
creating special versions for debugging, profiling, and
production on different machines. This task is typically
managed by Make-like tools and we will look at what has
happened since Make was invented in 1972. Embedding an
interpreter for a small language into an application is a
systematical way to obtain applications that are flexible at
run-time; they may be even programmed by the end user. We
will look at languages especially designed for embedding and
the corresponding application architectures.
Besides covering the topics outlined above, the seminar aims
to improve a student's ability to read, criticize, and write
papers. Therefore, the seminar is organized into two phases:
During the first phase, we will collectively read, discuss,
and criticize papers during our weekly meeting. I'm
expecting participants to ask and answer questions about
papers during meetings and will hand out writing exercises.
Typically I'll hand out papers at a meeting and expect
participants to have read them until the next meeting where
we are going to discuss them.
In the second phase, each participant picks a topic from
the papers we have read and tries to apply it to a
self-chosen problem. The seminar ends with a short
presentation of the experience at the end of the semester.
The seminar is taught by Christian
Participants will receive 9 credit points for successful
The number of participants is limited to about 12; you can
send me an email to sign up
tentatively for the seminar and to receive announcements
for forthcoming details.
Dates: we will meet weekly on Wednesdays from 2pm to 4pm at
the seminar room S-328, building 45.
The first meeting will be during the first week of
the semester, on
Wednesday, April 21, 2pm-4pm st, room 328, building
Scrutiny of the Abstract II, Kenneth K. Landes, AAPG
Bull., Vol. 50, No. 9, p.1992.
Make -- A Porgram for Maintaining Computer Programs, Stuart
I. Feldman, Software Pratice and Experience, Vol. 9, 1997,
Recursive Make Considered Harmful, Peter Miller, AUUGN
Journal of AUUG Inc, 19(1), pp. 14-25, 1998.
Stephen Knight, 2000.
Caching Function Calls Using Precise Dependencies,
Allan Heydon, Roy Levin, Yuan Yu. Appeared in Programming
Language Design and Implementation (PLDI) 2000.
Tcl: An Embeddable Command
Language, John K. Ousterhout, Winter USENIX Conference,
libscheme:Scheme as a Library by Brent W. Benson Jr.;
Proceedings of the USENIX Symposium on Very High Level
Languages, page 7-20, October 1994.
extensible extension language
by Roberto Ierusalimschy et al.; it appeared in
Software: Practice and Experience 26(6), pp.635-652, 1996.
Embedding an Interpreted Language Using Higher-Order Functions
by Norman Ramsey; the paper appeared in ACM SIGPLAN 2003
Workshop on Interpreters, Virtual Machines and Emulators.
Introduction to the course; organization, work load.
Questions about A Scrutinity of the Abstract (group
Assignment for Make -- A Program for Maintaining
A summary of Make -- A Program for Maintaining Computer
Questions about Make (group work)
Assignment for Recursive Make Considered Harmful
Summary of Recursive Make Considered Harmful
Questions about Recursive Make Considered Harmful
Assignment for Cons
Summary of Cons
Questions about Cons
Assignment for Caching Function Calls Using Precise
Dependencies by Heydon et al.
Summary of Vesta
Questions about Vesta (group work)
Propose a small project related to software building
Assignment for Tcl: An Embeddable Command Language
Summary of Tcl: An Embeddable Command Language
Questions about Tcl (group work)
Assignment for Scheme as a C Library by B. W.
Brenson Jr.; the Scheme Quick
Reference might be useful
- Questions about libscheme (group work)
Summary of libscheme: Scheme as a C library
Assignment for Lua--an extensible extension language by
Roberto Ierusalimschy et al.
- Summary of Lua--an extensible extension language
- Questions about Lua (group work)
- Assignment for Embedding an Interpreted Language Using
Higher-Order Functions and Types.
- Summary of Embedding an Interpreted Language Using
Higher-Order Functions and Types.
- Questions about Embedding an Interpreted Language Using
Higher-Order Functions and Types (group work)
Impressum ● Datenschutzerklärung
<firstname.lastname@example.org> · http://www.st.cs.uni-saarland.de/edu/config-ss04/ · Stand: 2018-04-05 13:40