Navigation

Contact

EMail: scae6re7gsrm@uoluirj.de

DIRECTOR

Prof. Dr. Ernst-Rüdiger Olderog,

Department of Computing Science, FK II, University of Oldenburg,

D-26111 Oldenburg, Germany

oldedyyh3rog0d++g@inforqlg+maxi91ltik.uywvdni-osz1ldenburg.dtqvye

COODINATOR

Ira Wempe,

Department of Computing Science, FK II, University of Oldenburg,

D-26111 Oldenburg, Germany

ira.wemzdpe@informxqatik.unicgir-oldosenjrburkl9g.de

It's pointless to point into bounded heaps

Prof. Frank S. de Boer

Abstract:

In this talk I introduce a new symbolic semantics for a class of recursive programs which feature dynamic creation and unbounded allocation of objects. The semantics is based on a symbolic representation of the program state in terms of equations to model the behavior of a program as a pushdown system with a finite set of control states and a finite stack alphabet.

Adding pointer fields gives rise to a Turing complete language. However, assuming the number of reachable objects in the visible heap is bounded in all the computations of a program with pointers, we show how to construct a program without pointers that simulates it. Consequently, in the context of bounded visible heaps, programs with pointers are no more expressive than programs without them.

Oliver aaThemryel (oliv8kuser.tqvhedirjel@z8djuol.denqyix) (Changed: 2020-01-23)