Sciweavers

238 search results - page 7 / 48
» The RoadRunner dynamic analysis framework for concurrent pro...
Sort
View
ENTCS
2007
91views more  ENTCS 2007»
13 years 8 months ago
Timed Concurrent Constraint Programming for Analysing Biological Systems
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...
Julian Gutierrez, Jorge A. Pérez, Camilo Ru...
SIGSOFT
2010
ACM
13 years 6 months ago
An effective dynamic analysis for detecting generalized deadlocks
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...
Pallavi Joshi, Mayur Naik, Koushik Sen, David Gay
CAV
2007
Springer
112views Hardware» more  CAV 2007»
14 years 2 months ago
Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures
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...
Ahmed Bouajjani, Séverine Fratani, Shaz Qad...
POPL
1990
ACM
14 years 2 days ago
Concurrent Constraint Programming
Abstract. Concurrent constraint programming is a simple but powerful framework for computation based on four basic computational ideas: concurrency (multiple agents are simultaneou...
Vijay A. Saraswat, Martin C. Rinard
IEEEPACT
2009
IEEE
13 years 6 months ago
Adaptive Locks: Combining Transactions and Locks for Efficient Concurrency
Transactional memory is being advanced as an alternative to traditional lock-based synchronization for concurrent programming. Transactional memory simplifies the programming mode...
Takayuki Usui, Reimer Behrends, Jacob Evans, Yanni...