107 search results - page 16 / 22 » Context-Bounded Model Checking of Concurrent Software |
WDAG
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
SIGSOFT
2008
ACM
15 years 10 months ago
2008
ACM
We propose a novel method for modular verification of web service compositions. We first use symbolic fixpoint computations to derive conditions on the incoming messages and relat...
118
click to vote
SIGSOFT
2010
ACM
14 years 7 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...
ADAEUROPE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The Ravenscar Profile is a restricted subset of the Ada tasking model, designed to meet the requirements of producing analysable and deterministic code. A central featur...
ISSTA
1998
ACM
15 years 1 months ago
1998
ACM
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...