CTL model checking on a shared-memory architecture
From MaRDI portal
Publication:2431771
DOI10.1007/S10703-006-0008-ZzbMATH Open1102.68504OpenAlexW1977090137MaRDI QIDQ2431771FDOQ2431771
Authors: Cornelia P. Inggs, Howard Barringer
Publication date: 24 October 2006
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-006-0008-z
Recommendations
Cites Work
- Practical CTL* model checking: Should SPIN be extended?
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Using assumptions to distribute alternation free {\(\mu\)}-calculus model checking
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Using assumptions to distribute CTL model checking
- Distributed explicit bounded LTL model checking
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- A Multi-Core Solver for Parity Games
- Distributed verification of multi-threaded C++ programs
- Measuring and evaluating parallel state-space exploration algorithms
- Title not available (Why is that?)
- Parallelizing a symbolic compositional model-checking algorithm
- An experiment on parallel model checking of a CTL fragment
- Effective state exploration for model checking on a shared memory architecture
- Load balancing parallel explicit state model checking
- A stack-slicing algorithm for multi-core model checking
- CTL\(^*\) model checking on a shared-memory architecture
- Model Checking Software
Uses Software
This page was built for publication: CTL model checking on a shared-memory architecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431771)