Lab for Automated Reasoning and Analysis LARA

Lecture 14: Procedures, Memory, SSA, Instruction Selection

Continuing from Lecture 13

Compiling Advanced forms of Procedures


Explicit Dynamic Memory Management

How to implement heap where data lives longer than procedures in which it is created?

Malloc and Free

Scala code:

Free Lists by Size


  • Donald Knuth. Fundamental Algorithms, Third Edition. Addison-Wesley, 1997. ISBN 0-201-89683-4. Section 2.5: Dynamic Storage Allocation, pp.435–456.
  • Tiger book, Chapter 13

Static Single Assignment form of Programs


Instruction Selection


Further EPFL Courses

cc09/lecture_14.txt · Last modified: 2010/10/01 21:58 by vkuncak
© EPFL 2018 - Legal notice