Memory safety and race freedom in concurrent programming languages with linear capabilities

Vazou, N; Papakyriakou, M; Papaspyrou, N

dc.contributor.author	Vazou, N	en
dc.contributor.author	Papakyriakou, M	en
dc.contributor.author	Papaspyrou, N	en
dc.date.accessioned	2014-03-01T02:53:21Z
dc.date.available	2014-03-01T02:53:21Z
dc.date.issued	2011	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/36257
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-83155184662&partnerID=40&md5=7b7ef706fd520492eb4d2bb5a028a021	en
dc.subject.other	Concurrent languages	en
dc.subject.other	Concurrent programming languages	en
dc.subject.other	Data races	en
dc.subject.other	Language features	en
dc.subject.other	Memory locations	en
dc.subject.other	Memory safety	en
dc.subject.other	Type systems	en
dc.subject.other	Computer programming languages	en
dc.subject.other	Concurrency control	en
dc.subject.other	Information systems	en
dc.subject.other	Computer systems programming	en
dc.title	Memory safety and race freedom in concurrent programming languages with linear capabilities	en
heal.type	conferenceItem	en
heal.identifier.secondary	6078305	en
heal.publicationDate	2011	en
heal.abstract	In this paper we show how to statically detect memory violations and data races in a concurrent language, using a substructural type system based on linear capabilities. However, in contrast to many similar type-based approaches, our capabilities are not only linear, providing full access to a memory location but unshareable; they can also be read-only, thread-exclusive, and unrestricted, all providing restricted access to memory but extended shareability in the program source. Our language features two new operators, let! and lock, which convert between the various types of capabilities. © 2011 Polish Info Processing Soc.	en
heal.journalName	2011 Federated Conference on Computer Science and Information Systems, FedCSIS 2011	en
dc.identifier.spage	833	en
dc.identifier.epage	840	en