178 search results - page 15 / 36 » Model Checking Concurrent Programs with Nondeterminism and R... |
DC
2010
13 years 9 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
KBSE
2007
IEEE
14 years 3 months ago
2007
IEEE
Concurrent programs are difficult to debug and verify because of the nondeterministic nature of concurrent executions. A particular concurrency-related bug may only show up under ...
SOFTVIS
2010
ACM
13 years 9 months ago
2010
ACM
Multi-core processors have become increasingly prevalent, driving a software shift toward concurrent programs which best utilize these processors. Testing and debugging concurrent...
VMCAI
2004
Springer
14 years 2 months ago
2004
Springer
In this paper we deal with the problem of applying model checking to real programs. We verify a program without constructing the whole transition system using a technique based on...
CAV
2008
Springer
13 years 10 months ago
2008
Springer
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...