An improved case-based approach to LTL model checking

Authors:
Fei Pu;Wenhui Zhang;Shaochun Wang
Affiliations:
Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China;Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China;Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China
Venue:
RISE'05 Proceedings of the Second international conference on Rapid Integration of Software Engineering Techniques
Year:
2005

Citing 16
Cited 0

Design and validation of computer protocols

Design and validation of computer protocols
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Model checking and abstraction

ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking

Model checking
Model Checking at IBM

Formal Methods in System Design
Using SPIN to Verify Security Properties of Cryptographic Protocols

Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Compositional Reasoning in Model Checking

COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Verification of Infinite State Systems by Compositional Model Checking

CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Ten Years of Partial Order Reduction

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Efficient Decision Procedures for Model Checking of Linear Time Logic Properties

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Symmetry and Reduced Symmetry in Model Checking

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Combining static analysis and case-based search space partitioning for reducing peak memory in model checking

Journal of Computer Science and Technology
Static Analysis for State-Space Reductions Preserving Temporal Logics

Formal Methods in System Design
Spin model checker, the: primer and reference manual

Spin model checker, the: primer and reference manual
Experimental analysis of different techniques for bounded model checking

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The state space explosion is the key obstacle of model checking. Even a relatively small system specification may yield a very large state space. The case-based approach based on search space partition has been proposed in [18, 19] for reducing model checking complexity. This paper extends the approach by considering wider ranges of case-bases of models and multiple case-bases such that it can be applied to more types of applications. The improved approach also combines the search space partition and static analysis or expert knowledge for guaranteeing the completeness of the cases. The case study demonstrates the potential advantages of the strategy and show that the strategy may improve the efficiency of system verification and therefore scale up the applicability of the verification approach.