523 search results - page 39 / 105 » A General Model for Reachability Testing of Concurrent Progr... |
118
Voted
OSDI
2008
ACM
16 years 2 months ago
2008
ACM
Deadlock is an increasingly pressing concern as the multicore revolution forces parallel programming upon the average programmer. Existing approaches to deadlock impose onerous bu...
126
Voted
IWMM
2009
Springer
15 years 9 months ago
2009
Springer
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
128
Voted
CACM
2010
15 years 2 months ago
2010
Exploiting the multiprocessors that have recently become ubiquitous requires high-performance and reliable concurrent systems code, for concurrent data structures, operating syste...
136
click to vote
DC
2010
15 years 2 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
137
click to vote
LOPSTR
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper we focus on the problem of testing agent programs written in BUpL, an executable, high-level modelling agent language. Our approach consists of two main ste...