Sciweavers

271 search results - page 6 / 55
» Detecting Deadlocks in Concurrent Systems
Sort
View
ARTS
1999
Springer
13 years 12 months ago
Verifying Progress in Timed Systems
In this paper we study the issue of progress for distributed timed systems modeled as the parallel composition of timed automata. We clarify the requirements of discrete progress (...
Stavros Tripakis
SIGSOFT
2010
ACM
13 years 5 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
SPIN
2000
Springer
13 years 11 months ago
Model-Checking Multi-threaded Distributed Java Programs
Systematic state-space exploration is a powerful technique for veri cation of concurrent software systems. Most work in this area deals with manually-constructed models of those sy...
Scott D. Stoller
CONCURRENCY
2004
108views more  CONCURRENCY 2004»
13 years 7 months ago
Finding stale-value errors in concurrent programs
Concurrent programs can suffer from many types of errors, not just the wellstudied problems of deadlocks and simple race conditions on variables. This paper addresses a kind of ra...
Michael Burrows, K. Rustan M. Leino
RTCSA
1999
IEEE
13 years 12 months ago
Dynamic Adjustment of Serialization Order Using Timestamp Intervals in Real-Time Databases
Although an optimistic approach has been shown to be better than locking protocols for real-time database systems (RTDBS), it has the problems of unnecessary restarts and heavy re...
Jan Lindström, Kimmo E. E. Raatikainen