Sciweavers

1499 search results - page 125 / 300
» Chopping Concurrent Programs
Sort
View
PPOPP
2012
ACM
14 years 1 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
PPOPP
2005
ACM
15 years 11 months ago
Automated type-based analysis of data races and atomicity
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose at run-time. This motivated the development of type systems that statically en...
Amit Sasturkar, Rahul Agarwal, Liqiang Wang, Scott...
CSFW
2008
IEEE
16 years 21 days ago
A Type System for Observational Determinism
Zdancewic and Myers introduced observational determinism as a scheduler independent notion of security for concurrent programs. This paper proposes a type system for verifying obs...
Tachio Terauchi
ATVA
2005
Springer
130views Hardware» more  ATVA 2005»
15 years 11 months ago
Approximate Reachability for Dead Code Elimination in Esterel
Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel extends Esterel with a noninstantaneous jump instruction (compatible with conc...
Olivier Tardieu, Stephen A. Edwards
ECOOP
2008
Springer
15 years 8 months ago
Kilim: Isolation-Typed Actors for Java
This paper describes Kilim, a framework that employs a combination of techniques to help create robust, massively concurrent systems in mainstream languages such as Java: (i) ultra...
Sriram Srinivasan, Alan Mycroft