74 search results - page 11 / 15 » An Evaluation of Slicing Algorithms for Concurrent Programs |
164
click to vote
PLDI
2009
ACM
16 years 9 days ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
176
click to vote
WCRE
2000
IEEE
15 years 10 months ago
2000
IEEE
Component recovery supports program understanding, architecture recovery, and re-use. Among the best known techniques for detection of re-usable objects (related global variables ...
180
Voted
SPAA
2010
ACM
15 years 10 months ago
2010
ACM
Transactional Memory (TM) is a promising technique that simplifies parallel programming for shared-memory applications. To date, most TM systems have been designed to efficientl...
118
click to vote
PLDI
2010
ACM
15 years 10 months ago
2010
ACM
Traditional data-oriented programming languages such as dataflow s and stream languages provide a natural abstraction for parallel programming. In these languages, a developer fo...
157
Voted
SPAA
2010
ACM
15 years 5 months ago
2010
ACM
We present a scheduling algorithm of stream programs for multi-core architectures called team scheduling. Compared to previous multi-core stream scheduling algorithms, team schedu...