523 search results - page 1 / 105 » A General Model for Reachability Testing of Concurrent Progr... |
ICFEM
2004
Springer
13 years 10 months ago
2004
Springer
Reachability testing is a technique for testing concurrent programs. Reachability testing derives test sequences on-the-fly as the testing process progresses, and can be used to sy...
ENTCS
2002
13 years 4 months ago
2002
The difficulty of finding errors caused by unexpected interleavings of threads in concurrent programs is well known. Model checkers can pinpoint such errors and verify correctness...
ESEC
1995
Springer
13 years 8 months ago
1995
Springer
This paper presents the results of an exploratory experiment investigating the use of program metrics to predict reachability graph size, reachability graph generation time, and d...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
FSTTCS
2005
Springer
13 years 10 months ago
2005
Springer
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...