We show how to adapt an existing non-DFS-based accepting cycle detection algorithm
OWCTY [10, 15, 29] to the I/O efficient setting and compare its I/O efficiency and practical …

Explicit model checking with magnetic disk is prohibitively slow if file input/output (IO) is not
carefully managed. We give an empirical analysis of the two published algorithms for model …

Computational resources are increasing rapidly with the explosion of multi-core processors
readily available from major vendors. Model checking needs to harness these resources to …

Directed model checking algorithms focus computation resources in the error-prone areas of
concurrent systems. The algorithms depend on some empirical analysis to report their …

While exhaustive state space traversal is not feasible in reasonable time for complex
concurrent programs, many techniques for efficient detection of concurrency errors and …

Abstract We present DRS (Deep Random Search), a new Las Vegas algorithm for model
checking safety properties of timed automata. DRS explores the state space of the …

State space traversal is a very popular approach to detect concurrency errors and test
concurrent programs. However, it is not practically feasible for complex programs with many …

With the increase in complexity and degree of parallelism of computer systems, it became
even more important to develop formal methods for ensuring their quality. Correctness and …

The bugbear of model checking is the explosion in the number of states as the number of
processes increases. Industrial-sized problems are often intractable for model checkers. We …

Despite a decade of intensive research on general techniques for reducing the complexity of
model checking, scalability remains the chief obstacle to its widespread adoption. Past …