85 search results - page 7 / 17 » Partial-Order Reduction in Symbolic State Space Exploration |
KBSE
2007
IEEE
15 years 4 months ago
2007
IEEE
Concurrent programs are difficult to debug and verify because of the nondeterministic nature of concurrent executions. A particular concurrency-related bug may only show up under ...
CAV
2010
Springer
15 years 2 months ago
2010
Springer
Testing of multi-threaded programs poses enormous challenges. To improve the coverage of testing, we present a framework named CONTESSA that augments conventional testing (concrete...
91
Voted
IFM
2009
Springer
15 years 4 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...
71
Voted
CAV
2008
Springer
15 years 6 days ago
2008
Springer
Ideally, a model checking tool should successfully tackle state space explosion for complete system validation, while providing short counterexamples when an error exists. Techniqu...
77
Voted
DATE
2009
IEEE
15 years 5 months ago
2009
IEEE
In the field of chip design, hardware module reuse is a standard solution to the increasing complexity of chip architecture and the pressures to reduce time to market. In the abs...