1855 search results - page 156 / 371 » Composing model programs for analysis |
117
Voted
FOAL
2008
ACM
15 years 5 months ago
2008
ACM
Often, insertion of several aspects into one system is desired and in that case the problem of interference among the different aspects might arise, even if each aspect individual...
156
click to vote
CAV
2009
Springer
16 years 4 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...
133
Voted
POPL
2010
ACM
15 years 3 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
125
click to vote
IWMM
2009
Springer
15 years 10 months ago
2009
Springer
Good spatial locality alleviates both the latency and bandwidth problem of memory by boosting the effect of prefetching and improving the utilization of cache. However, convention...
177
Voted
IFIP
2010
Springer
14 years 10 months ago
2010
Springer
Concurrent software is difficult to verify. Because the thread schedule is not controlled by the application, testing may miss defects that occur under specific thread schedules. T...