Combining search space partition and abstraction for LTL model checking
DOI10.1007/S11432-007-0073-YzbMATH Open1142.68522OpenAlexW1964632015MaRDI QIDQ2465733FDOQ2465733
Authors: Fei Pu, Wenhui Zhang 
Publication date: 7 January 2008
Published in: Science in China. Series F (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11432-007-0073-y
Recommendations
- scientific article; zbMATH DE number 898449
- scientific article; zbMATH DE number 1948409
- Efficient patterns for model checking partial state spaces in CTL \(\cap\) LTL
- LTL-model-checking via model composition
- Automated Technology for Verification and Analysis
- Combining Abstraction Refinement and SAT-Based Model Checking
- LTL Generalized Model Checking Revisited
- An efficient approach for abstraction-refinement in model checking
- Parallel nested depth-first searches for LTL model checking
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Property preserving abstractions for the verification of concurrent systems
- Title not available (Why is that?)
- Making abstract interpretations complete
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- Issues in slicing PROMELA and its applications to model checking, protocol understanding, and simulation
- Title not available (Why is that?)
- Combining static analysis and case-based search space partitioning for reducing peak memory in model checking
- Title not available (Why is that?)
- Automated Technology for Verification and Analysis
Cited In (4)
Uses Software
This page was built for publication: Combining search space partition and abstraction for LTL model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465733)
