219 search results - page 5 / 44 » Dynamic partial-order reduction for model checking software |
216
Voted
POPL
2005
ACM
16 years 2 months ago
2005
ACM
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
131
Voted
IFM
2009
Springer
15 years 9 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
158
Voted
PPOPP
2009
ACM
16 years 3 months ago
2009
ACM
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
109
Voted
ICFEM
2009
Springer
15 years 9 months ago
2009
Springer
Rapid development in hardware industry has brought the prevalence of multi-core systems with shared-memory, which enabled the speedup of various tasks by using parallel algorithms....
127
Voted
FSTTCS
2006
Springer
15 years 6 months ago
2006
Springer
In recent papers, the partial order reduction approach has been adapted to reason about the probabilities for temporal properties in concurrent systems with probabilistic behaviour...