1. Parosh Aziz Abdulla , Bengt Jonsson , Pritha Mahata , and Julien d’ Orso . 2002 . Regular Tree Model Checking. In Computer Aided Verification , 14th International Conference, CAV 2002,Copenhagen, Denmark, July 27-31, 2002, Proceedings(Lecture Notes in Computer Science, Vol. 2404) , Ed Brinksma and Kim Guldstrand Larsen (Eds.). Springer, 555–568. https://doi.org/10.1007/3-540-45657-0_47 Parosh Aziz Abdulla, Bengt Jonsson, Pritha Mahata, and Julien d’Orso. 2002. Regular Tree Model Checking. In Computer Aided Verification, 14th International Conference, CAV 2002,Copenhagen, Denmark, July 27-31, 2002, Proceedings(Lecture Notes in Computer Science, Vol. 2404), Ed Brinksma and Kim Guldstrand Larsen (Eds.). Springer, 555–568. https://doi.org/10.1007/3-540-45657-0_47
2. A Survey of Regular Model Checking
3. Pablo Barceló , Chih-Duo Hong , Xuan Bach Le , Anthony W. Lin , and Reino Niskanen . 2019 . Monadic Decomposability of Regular Relations. In 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 , July 9-12, 2019, Patras, Greece(LIPIcs, Vol. 132), Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 103:1–103:14. https://doi.org/10.4230/LIPIcs.ICALP. 2019.103 Pablo Barceló, Chih-Duo Hong, Xuan Bach Le, Anthony W. Lin, and Reino Niskanen. 2019. Monadic Decomposability of Regular Relations. In 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece(LIPIcs, Vol. 132), Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 103:1–103:14. https://doi.org/10.4230/LIPIcs.ICALP.2019.103
4. Pascal Bergsträßer Moses Ganardi Anthony W. Lin and Georg Zetzsche. 2022. Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification. CoRR abs/2205.09015(2022). https://doi.org/10.48550/arXiv.2205.09015 arXiv:2205.09015 Pascal Bergsträßer Moses Ganardi Anthony W. Lin and Georg Zetzsche. 2022. Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification. CoRR abs/2205.09015(2022). https://doi.org/10.48550/arXiv.2205.09015 arXiv:2205.09015
5. Achim Blumensath and Erich Grädel . 2000 . Automatic Structures. In 15th Annual IEEE Symposium on Logic in Computer Science , Santa Barbara, California, USA , June 26-29, 2000. IEEE Computer Society, 51–62. https://doi.org/10.1109/LICS.2000.855755 Achim Blumensath and Erich Grädel. 2000. Automatic Structures. In 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, California, USA, June 26-29, 2000. IEEE Computer Society, 51–62. https://doi.org/10.1109/LICS.2000.855755