Methods to tackle state explosion problem in model checking

Authors:
Zhu Xin-feng;Wang Jian-dong;Zhu Xin-feng;Li Bin;Zhu Jun-wu;Wu Jun
Affiliations:
College of Information Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China;College of Information Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China;Institute of Information Technology, Yangzhou University, Yangzhou, China;Institute of Information Technology, Yangzhou University, Yangzhou, China;Institute of Information Technology, Yangzhou University, Yangzhou, China;Institute of Information Technology, Yangzhou University, Yangzhou, China
Venue:
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
Year:
2009

Citing 8
Cited 0

Memory-efficient algorithms for the verification of temporal properties

Formal Methods in System Design - Special issue on computer-aided verification: general methods
Model checking

Model checking
Verifying the performance of the PCI local bus using symbolic techniques

ICCD '95 Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors
Simple on-the-fly automatic verification of linear temporal logic

Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Using On-The-Fly Verification Techniques for the Generation of test Suites

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
An Introduction to Kolmogorov Complexity and Its Applications

An Introduction to Kolmogorov Complexity and Its Applications
Generalized symbolic execution for model checking and testing

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Employing symmetry reductions in model checking

Computer Languages, Systems and Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

Model checking is an automatic verification technique for finite state concurrent systems. In this approach to verification, temporal logic specifications are checked by an exhaustive search of the state space of the concurrent system. The size of the state space grows exponentially with the number of processes. This phenomenon is commonly called "State Explosion Problem". Many progress has been made on this problem. The main techniques can be classified into three types (1) based on automata theory, such as on-the-fly technique, partial order reduction technique etc. (2) based on symbolic structure, such as bounded model checking, SAT bounded model checking etc. (3) other methods such as abstraction, Symmetry, Compositional Reasoning etc. The aim of this paper is to give a succinct survey of methods to tackle State Explosion Problem in Model Checking.