Name
Abstract | ||
|---|---|---|
While stateless model checking avoids the memory blow-up problem by not recording the search history, runtime becomes a major limiting factor. In this paper, we present distributed dynamic partial order reduction (DDPOR) which can speed up stateless model checking using computer clusters, and get the benefit of dynamic partial order reduction (DPOR). The experiments show that DDPOR can give out nearly linear (with respect to the number of CPUs) speedup on realistic multithreaded programs, comparing with sequential stateless model checking that uses DPOR. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/s10009-010-0144-z | STTT |
Keywords | Field | DocType |
dynamic verification · stateless · distributed model checking,sequential stateless model checking,stateless model checking,realistic multithreaded program,memory blow-up problem,computer cluster,dynamic partial order reduction,search history,stateless,model checking,partial order reduction,limiting factor | Abstraction model checking,Model checking,Computer science,Limiting factor,Theoretical computer science,Real-time computing,Partial order reduction,Stateless protocol,Search history,Computer cluster,Speedup | Journal |
Volume | Issue | ISSN |
12 | 2 | 1433-2787 |
Citations | PageRank | References |
1 | 0.35 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yu Yang | 1 | 91 | 4.25 |
| Xiaofang Chen | 2 | 1 | 0.35 |
| Ganesh Gopalakrishnan | 3 | 1619 | 130.11 |
| Robert M. Kirby | 4 | 1443 | 115.55 |