First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time

Alexander Kartzow. First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time. In Lars Birkedal, editor, Foundations of Software Science and Computational Structures - 15th International Conference, FOSSACS 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings. Volume 7213 of Lecture Notes in Computer Science, pages 376-390, Springer, 2012. [doi]

Abstract

Abstract is missing.