Publisher
Springer International Publishing
Reference82 articles.
1. Atig, M. F. (2010). Global model checking of ordered multi-pushdown systems. In K. Lodaya & M. Mahajan (Eds.), IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010 (Vol. 8, pp. 216–227). LIPIcs. Chennai: Schloss Dagstuhl - Leibniz- Zentrum für Informatik.
2. Baker, B. S. & Book, R. V. (1974). Reversal-bounded multipushdown machines. Journal of Computer and System Sciences, 8(3), 315–332.
3. Balbiani, P. & Orłowska, E. (1999). A hierarchy of modal logics with relative accessibility relations. Journal of Applied Non-Classical Logics: Special Issue in the Memory of George Gargov, 9(2–3), 303–328.
4. Berman, L. (1980). The complexity of logical theories. Theoretical Computer Science, 11, 71–77.
5. Bersani, M. M. & Demri, S. (2011). The complexity of reversal-bounded model-checking. In C. Tinelli & V. Sofronie-Stokkermans (Eds.), Proceedings of Frontiers of Combining Systems, 8th International Symposium, FroCoS 2011 (Vol. 6989, pp. 71–86). Lecture Notes in Computer Science. Saarbrücken, Germany.