We describe a dynamic partitioning scheme usable by model checking techniques that divide the state space into partitions, such as most external memory and distributed model checking algorithms. The goal of the scheme is to reduce the number of transitions that link states belonging to different partitions, and thereby limit the amount of disk access and network communication. We report on several experiments made with our verification platform ASAP that implements the dynamic partitioning scheme proposed in this paper. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Evangelista, S., & Kristensen, L. M. (2009). Dynamic state space partitioning for external memory model checking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5825 LNCS, pp. 70–85). https://doi.org/10.1007/978-3-642-04570-7_7
Mendeley helps you to discover research relevant for your work.