We propose a type system to guarantee safe resource deal-location for shared-memory concurrent programs by extend-ing the previous type system based on fractional ownerships. Here, safe resource deallocation means that memory cells, locks, or threads are not left allocated when a program ter-minates. Our framework supports (1) fork/join parallelism, (2) synchronization with locks, and (3) dynamically allo-cated memory cells and locks. The type system is proved to be sound. We also provide a type inference algorithm for the type system and a prototype implementation of the algo-rithm
The aim of a software transactional memory (STM) system is to facilitate the design of concurrent pr...
Abstract. We present a novel model of concurrent computations with shared memory and provide a simpl...
The recent development of multi-core computer architectures has largely affected the creation of eve...
In the modern, multi-threaded, multi-core programming environment, correctly managing system resourc...
A challenge for programming language research is to design and implement multi-threaded low-level la...
We present a destruction-aware type system for the functional lan-guage Safe, which is a first-order...
Since the early 2000s, in order to keep up with the performance predictions of Moore's law, hardware...
We present a refinement type system for reasoning about asynchronous programs manipulating shared mu...
Abstract. In the modern, multi-threaded, multi-core programming environment, correctly manag-ing sys...
Shared-memory concurrent programming is difficult and error prone because memory accesses by concurr...
Concurrent object-oriented programming languages coordinate conflicting memory accesses through lock...
Abstract. Type systems for programming languages help reasoning about program behavior and early fin...
We formalise a thread-based concurrent language which makes resource control possible. Concurrency i...
A current challenge for programming language research is to design and implement multithreaded low-l...
We propose a multicore-ready programming language based on a two-level shared memory model. Concurre...
The aim of a software transactional memory (STM) system is to facilitate the design of concurrent pr...
Abstract. We present a novel model of concurrent computations with shared memory and provide a simpl...
The recent development of multi-core computer architectures has largely affected the creation of eve...
In the modern, multi-threaded, multi-core programming environment, correctly managing system resourc...
A challenge for programming language research is to design and implement multi-threaded low-level la...
We present a destruction-aware type system for the functional lan-guage Safe, which is a first-order...
Since the early 2000s, in order to keep up with the performance predictions of Moore's law, hardware...
We present a refinement type system for reasoning about asynchronous programs manipulating shared mu...
Abstract. In the modern, multi-threaded, multi-core programming environment, correctly manag-ing sys...
Shared-memory concurrent programming is difficult and error prone because memory accesses by concurr...
Concurrent object-oriented programming languages coordinate conflicting memory accesses through lock...
Abstract. Type systems for programming languages help reasoning about program behavior and early fin...
We formalise a thread-based concurrent language which makes resource control possible. Concurrency i...
A current challenge for programming language research is to design and implement multithreaded low-l...
We propose a multicore-ready programming language based on a two-level shared memory model. Concurre...
The aim of a software transactional memory (STM) system is to facilitate the design of concurrent pr...
Abstract. We present a novel model of concurrent computations with shared memory and provide a simpl...
The recent development of multi-core computer architectures has largely affected the creation of eve...