Copenhagen Programming Language Seminar
Previous shape analysis algorithms assume that the heap can be characterized in terms of reachability, that it is composed of discrete nodes that can be accessed only via access paths built from variables and field names. This assumption is violated by pointer arithmetic.
Lars Birkedal. Administrative host:
Camilla Jensen. All are welcome.
The Copenhagen Programming Language Seminar (COPLAS) is a collaboration between DIKU, ITU and KVL.
COPLAS is sponsored by FIRST Graduate School.
To receive information about COPLAS talks by email, send a message to firstname.lastname@example.org with the word 'subscribe' as subject or in the body.
For more information about COPLAS, see http://www.coplas.org