17 search results - page 1 / 4 » Reducing Concurrent Analysis Under a Context Bound to Sequen... |
CAV
2008
Springer
13 years 9 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...
CAV
2009
Springer
14 years 8 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
SPIN
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Context-Bounded Analysis has emerged as a practical automatic formal analysis technique for fine-grained, shared-memory concurrent software. Two recent papers (in CAV 20...
CAV
2007
Springer
14 years 1 months ago
2007
Springer
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...
APLAS
2010
ACM
13 years 5 months ago
2010
ACM
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...