Combining search space partition and abstraction for LTL model checking
From MaRDI portal
(Redirected from Publication:2465733)
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
Cites work
- scientific article; zbMATH DE number 1670775 (Why is no real title available?)
- scientific article; zbMATH DE number 1693039 (Why is no real title available?)
- scientific article; zbMATH DE number 1948409 (Why is no real title available?)
- scientific article; zbMATH DE number 1487866 (Why is no real title available?)
- scientific article; zbMATH DE number 2086523 (Why is no real title available?)
- scientific article; zbMATH DE number 2087639 (Why is no real title available?)
- Automated Technology for Verification and Analysis
- Combining static analysis and case-based search space partitioning for reducing peak memory in model checking
- Issues in slicing PROMELA and its applications to model checking, protocol understanding, and simulation
- Making abstract interpretations complete
- Property preserving abstractions for the verification of concurrent systems
- Tools and Algorithms for the Construction and Analysis of Systems
Cited in
(4)
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)