DocumentCode :
555980
Title :
Memory safety and race freedom in concurrent programming languages with linear capabilities
Author :
Vazou, Niki ; Papakyriakou, Michalis ; Papaspyrou, Nikolaos
Author_Institution :
Sch. of Electr. & Comput. Eng., Nat. Tech. Univ. of Athens, Athens, Greece
fYear :
2011
fDate :
18-21 Sept. 2011
Firstpage :
833
Lastpage :
840
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.
Keywords :
concurrency control; programming languages; security of data; storage management; concurrent language; concurrent programming language; data races; memory location; memory safety; memory violation detection; program source; race freedom; substructural type system; Computer languages; Concurrent computing; Electronic mail; Instruction sets; Runtime; Safety; Syntactics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science and Information Systems (FedCSIS), 2011 Federated Conference on
Conference_Location :
Szczecin
Print_ISBN :
978-1-4577-0041-5
Electronic_ISBN :
978-83-60810-35-4
Type :
conf
Filename :
6078305
Link To Document :
بازگشت