C. Baier & J.P. Katoen (2008):
Principles of Model Checking.
The MIT Press.
J. Barnat, L. Brim & P. Ročkai (2010):
Scalable Shared Memory LTL Model Checking.
STTT 12(2),
pp. 139–153,
doi:10.1007/s10009-010-0136-z.
J. Barnat, L. Brim, M. Češka & P. Ročkai (2010):
DiVinE: Parallel Distributed Model Checker (Tool paper).
In: Parallel and Distributed Methods in Verification and High Performance Computational Systems Biology (HiBi/PDMC 2010).
IEEE,
pp. 4–7,
doi:10.1007/978-3-540-88387-6_20.
L. Barnat, L. Brim & P. Ročkai (2009):
A Time-Optimal On-The-Fly Parallel Algorithm for Model Checking of Weak LTL Properties.
In: ICFEM 2009,
LNCS 5885.
Springer, Heidelberg,
pp. 407–425,
doi:10.1007/978-3-642-10373-5_21.
L. Brim, I. Cerná, P. Moravec & J. Simsa (2004):
Accepting Predecessors Are Better than Back Edges in Distributed LTL Model-Checking.
In: A.J. Hu & A.K. Martin: FMCAD,
Lecture Notes in Computer Science 3312.
Springer,
pp. 352–366,
doi:10.1007/978-3-540-30494-4_25.
C. Courcoubetis, M.Y. Vardi, P. Wolper & M. Yannakakis (1992):
Memory-Efficient Algorithms for the Verification of Temporal Properties.
Formal Methods in System Design 1(2/3),
pp. 275–288,
doi:10.1007/BFb0023737.
S. Evangelista, L. Petrucci & S. Youcef (2011):
Parallel Nested Depth-First Searches for LTL Model Checking.
In: T. Bultan & P.-A. Hsiung: Automated Technology for Verification and Analysis 2011,
Lecture Notes in Computer Science 6996.
Springer,
pp. 381–396,
doi:10.1007/978-3-642-24372-1_27.
S. Evangelista, L. Petrucci & S. Youcef (Last accessed 15 Sept 2011):
Parallel Nested Depth-First Searches for LTL Model Checking.
Technical Report.
Université Paris 13.
Available at http://www-lipn.univ-paris13.fr/~evangelista/doc/mc-ndfs.pdf.
A. Gaiser & S. Schwoon (2009):
Comparison of Algorithms for Checking Emptiness on Büchi Automata.
In: P. Hlinený, V. Matyáš & T. Vojnar: MEMICS'09,
OpenAccess Series in Informatics (OASIcs) 13,
Schloss Dagstuhl, Germany,
doi:10.4230/DROPS.MEMICS.2009.2349.
G.J. Holzmann, R. Joshi & A. Groce (2008):
Swarm Verification.
In: ASE.
IEEE,
L'Aquila, Italy,
pp. 1–6,
doi:10.1109/ASE.2008.9.
G.J. Holzmann, D. Peled & M. Yannakakis (1996):
On Nested Depth First Search.
In: The SPIN Verification System.
American Mathematical Society,
pp. 23–32.
A.E.J. Hyvärinen, T.A. Junttila & I. Niemelä (2008):
Strategies for Solving SAT in Grids by Randomized Search.
In: S. Autexier, J. Campbell, J. Rubio, V. Sorge, M. Suzuki & F. Wiedijk: AISC/MKM/Calculemus,
LNCS 5144.
Springer,
pp. 125–140,
doi:10.1007/978-3-540-85110-3_11.
A.W. Laarman, R. Langerak, J.C. van de Pol, M. Weber & A. Wijs (2011):
Multi-Core Nested Depth-First Search.
In: T. Bultan & P.-A. Hsiung: Automated Technology for Verification and Analysis 2011,
Lecture Notes in Computer Science 6996.
Springer,
pp. 321–335,
doi:10.1007/978-3-642-24372-1_23.
A.W. Laarman, J.C. van de Pol & M. Weber (2011):
Parallel Recursive State Compression for Free.
In: A. Groce & M. Musuvathi: SPIN,
Lecture Notes in Computer Science 6823.
Springer,
Snowbird, USA,
pp. 38–56,
doi:10.1007/978-3-642-22306-8_4.
A.W. Laarman, J.C. van de Pol & M. Weber (2010):
Boosting Multi-Core Reachability Performance with Shared Hash Tables.
In: N. Sharygina & R. Bloem: Proceedings of the 10th International Conference on Formal Methods in Computer-Aided Design, Lugano, Swiss.
IEEE Computer Society,
USA,
pp. 247–256.
Available at http://eprints.eemcs.utwente.nl/18437/.
A.W. Laarman, J.C. van de Pol & M. Weber (2011):
Multi-Core LTSmin: Marrying Modularity and Scalability.
In: M. Bobaru, K. Havelund, G. Holzmann & R. Joshi: Proceedings of the Third International Symposium on NASA Formal Methods, NFM 2011, Pasadena, CA, USA,
LNCS 6617.
Springer Verlag,
Berlin,
pp. 506–511,
doi:10.1007/978-3-642-20398-5_40.
R. Pelánek (2007):
BEEM: Benchmarks for Explicit Model Checkers.
In: Proc. of SPIN Workshop,
LNCS 4595.
Springer,
pp. 263–267,
doi:10.1007/978-3-540-73370-6_17.
J.H. Reif (1985):
Depth-first Search is Inherently Sequential.
Information Processing Letters 20(5),
pp. 229–234,
doi:10.1016/0020-0190(85)90024-9.
S. Schwoon & J. Esparza (2005):
A Note on On-the-Fly Verification Algorithms.
In: Nicolas Halbwachs & Lenore D. Zuck: Tools and Algorithms for the Construction and Analysis of Systems,
Lecture Notes in Computer Science 3440.
Springer,
pp. 174–190,
doi:10.1007/978-3-540-31980-1_12.
M.Y. Vardi & P. Wolper (1986):
An Automata-Theoretic Approach to Automatic Program Verification.
In: Proc. 1st Symp. on Logic in Computer Science,
Cambridge,
pp. 332–344.
Available at http://www.cs.rice.edu/~vardi/papers/lics86.pdf.gz.
I. Černá & R. Pelánek (2003):
Distributed Explicit Fair Cycle Detection (Set Based Approach).
In: T. Ball & S.K. Rajamani: SPIN,
Lecture Notes in Computer Science 2648.
Springer,
pp. 49–73,
doi:10.1007/3-540-44829-2_4.
eptcs@eptcs.org