Virtual Machines

Dr. Kumar Neeraj Verma
Prof. Dr. Helmut Seidl

(Summer Semester 2008)

Time and venue


Exam will be oral. To register and to fix an appointment, please email before 4 July 2008 at


While trying to produce code for a programming language like Prolog, one quickly realizes that one would like to use certain instructions during the translation which are not already available on concrete machines. On the other hand, instruction sets of modern computers are changing so quickly that it doesn't seem useful for the compiler to depend on some arbitrarily chosen instructions. Such a dependance would mean that in a few years one would feel obliged to rewrite the compiler anew. With the implementation of the first Pascal compilers, one already arrived at the idea of first generating code for a slightly idealized machine, each of whose instructions then only need to be implemented on different target machines. Translation of modern programming languages like Prolog, Haskell or Java are also based on this principle. On one hand this facilitates portability of the compiler. On the other hand this also simplifies the translation itself since one can choose a suitable instruction set according to the programming language to be translated. In particular, we consider:



Recorded lectures from previous years are available in the TeleTeachingTool archives.


VAM: Visualization of Abstract Machines.

Lecture slides


  1. PS, PDF
  2. PS, PDF
  3. PS, PDF
  4. PS, PDF
  5. PS, PDF
  6. PS, PDF
  7. PS, PDF
  8. PS, PDF
  9. PS, PDF
  10. PS, PDF
  11. PS, PDF
  12. PS, PDF