74 search results - page 9 / 15 » An Evaluation of Slicing Algorithms for Concurrent Programs |
ICSE
2008
IEEE-ACM
14 years 9 months ago
2008
IEEE-ACM
When software developers want to understand the reason for a program's behavior, they must translate their questions about the behavior into a series of questions about code,...
SIGMOD
1997
ACM
14 years 22 days ago
1997
ACM
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
CAV
2010
Springer
14 years 14 days ago
2010
Springer
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...
PPOPP
2010
ACM
14 years 5 months ago
2010
ACM
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...