Parallel search for LTL violations

Authors:
Michael D. Jones;Jacob Sorber
Affiliations:
Brigham Young University, Department of Computer Science, Provo, Utah, USA;Brigham Young University, Department of Computer Science, Provo, Utah, USA
Venue:
International Journal on Software Tools for Technology Transfer (STTT) - Special section on parallel and distributed model checking
Year:
2005

Citing 0
Cited 5

Parallel test generation and execution with Korat

Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Generating counter-examples through randomized guided search

Proceedings of the 14th international SPIN conference on Model checking software
January: a parallel algorithm for bug hunting based on insect behavior

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Guided Model Checking with a Bayesian Meta-heuristic

Fundamenta Informaticae - APPLICATION OF CONCURRENCY TO SYSTEM DESIGN (ACSD'04)
Scaling symbolic execution using ranged analysis

Proceedings of the ACM international conference on Object oriented programming systems languages and applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

Recent advances in parallel model checking for liveness properties achieve significant capacity increases over sequential model checkers. However, the capacity of parallel model checkers is in turn limited by available aggregate memory and network bandwidth. We propose a new parallel algorithm that sacrifices complete coverage for increased capacity to find errors. The algorithm, called BEE (for bee-based error exploration), uses coordinated depth-bounded random walks to reduce memory and bandwidth demands. A unique advantage of BEE is that it is well suited for use on clusters of nondedicated workstations.