238 search results - page 7 / 48 » The RoadRunner dynamic analysis framework for concurrent pro... |
114
Voted
ENTCS
2007
15 years 15 days ago
2007
In this paper we present our rst approach to model and verify biological systems using ntcc, a concurrent constraint process calculus. We argue that the partial information const...
168
Voted
SIGSOFT
2010
ACM
14 years 10 months ago
2010
ACM
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...
102
Voted
CAV
2007
Springer
15 years 6 months ago
2007
Springer
Bounded context switch reachability analysis is a useful and efficient approach for detecting bugs in multithreaded programs. In this paper, we address the application of this app...
118
click to vote
POPL
1990
ACM
15 years 4 months ago
1990
ACM
Abstract. Concurrent constraint programming is a simple but powerful framework for computation based on four basic computational ideas: concurrency (multiple agents are simultaneou...
126
click to vote
IEEEPACT
2009
IEEE
14 years 10 months ago
2009
IEEE
Transactional memory is being advanced as an alternative to traditional lock-based synchronization for concurrent programming. Transactional memory simplifies the programming mode...