Parallel nested depth-first searches for LTL model checking
DOI10.1007/978-3-642-24372-1_27zbMATH Open1348.68134OpenAlexW2287508180MaRDI QIDQ3172928FDOQ3172928
Authors: Sami Evangelista, Laure Petrucci, Samir Youcef 
Publication date: 7 October 2011
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24372-1_27
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (14)
- Distributed breadth-first search LTL model checking
- More scalable LTL model checking via discovering design-space dependencies \((D^3)\)
- BFS-based model checking of linear-time properties with an application on GPUs
- Revisiting Resistance Speeds Up I/O-Efficient LTL Model Checking
- CUDA accelerated LTL model checking -- revisited
- Automated verification of parallel nested DFS
- Combining search space partition and abstraction for LTL model checking
- Multi-core nested depth-first search
- An experiment on parallel model checking of a CTL fragment
- LTL Path Checking Is Efficiently Parallelizable
- Improved multi-core nested depth-first search
- Parallel model checking for \texttt{LTL}, \texttt{CTL}\(^*\), and \(L^2_{\mu}\)
- Finding strongly connected components of simple digraphs based on granulation strategy
- A stack-slicing algorithm for multi-core model checking
Uses Software
This page was built for publication: Parallel nested depth-first searches for LTL model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172928)
