Message Analysis for Concurrent Languages

Carlsson, R; Sagonas, K; Wilhelmsson, J

dc.contributor.author	Carlsson, R	en
dc.contributor.author	Sagonas, K	en
dc.contributor.author	Wilhelmsson, J	en
dc.date.accessioned	2014-03-01T02:49:20Z
dc.date.available	2014-03-01T02:49:20Z
dc.date.issued	2003	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34525
dc.subject	Concurrent Language	en
dc.subject	Dynamic Typing	en
dc.subject	Functional Language	en
dc.subject	Garbage Collection	en
dc.subject	interprocess communication	en
dc.subject	Memory Architecture	en
dc.subject	Message Passing	en
dc.subject	Perforation	en
dc.subject	Higher Order	en
dc.title	Message Analysis for Concurrent Languages	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/3-540-44898-5_5	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-44898-5_5	en
heal.publicationDate	2003	en
heal.abstract	We describe an analysis-driven storage allocation scheme for concur- rent languages that use message passing with copying semantics. The basic prin- ciple is that in such a language, data which is not part of any message does not need to be allocated in a shared data area. This allows for deallocation of thread- specific data without requiring global synchronization and	en
heal.journalName	Static Analysis Symposium/Workshop on Static Analysis	en
dc.identifier.doi	10.1007/3-540-44898-5_5	en