Sciweavers

271 search results - page 9 / 55
» Detecting Deadlocks in Concurrent Systems
Sort
View
SOSP
2003
ACM
14 years 4 months ago
RacerX: effective, static detection of race conditions and deadlocks
This paper describes RacerX, a static tool that uses flowsensitive, interprocedural analysis to detect both race conditions and deadlocks. It is explicitly designed to find erro...
Dawson R. Engler, Ken Ashcraft
VEE
2012
ACM
269views Virtualization» more  VEE 2012»
12 years 3 months ago
SimTester: a controllable and observable testing framework for embedded systems
In software for embedded systems, the frequent use of interrupts for timing, sensing, and I/O processing can cause concurrency faults to occur due to interactions between applicat...
Tingting Yu, Witawas Srisa-an, Gregg Rothermel
IPPS
2010
IEEE
13 years 5 months ago
Ensuring deterministic concurrency through compilation
Abstract--Multicore shared-memory architectures are becoming prevalent but bring many programming challenges. Among the biggest is non-determinism: the output of the program does n...
Nalini Vasudevan, Stephen A. Edwards
LPNMR
2001
Springer
14 years 3 days ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
FASE
2007
Springer
13 years 11 months ago
A Family of Distributed Deadlock Avoidance Protocols and Their Reachable State Spaces
Abstract. We study resource management in distributed systems. Incorrect handling of resources may lead to deadlocks, missed deadlines, priority inversions, and other forms of inco...
César Sánchez, Henny B. Sipma, Zohar...