Author:
Lange Martin,Latte Markus
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proc. 36th Ann. ACM Symp. on Theory of Computing, STOC 2004, pp. 202–211 (2004)
2. Lecture Notes in Computer Science;D. Bosnacki,2004
3. Lecture Notes in Computer Science;A. Bouajjani,1997
4. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. Congress on Logic, Method, and Philosophy of Science, pp. 1–12. Stanford University Press, Stanford (1962)
5. Lecture Notes in Computer Science;E.M. Clarke,1982
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Branching-time logics with path relativisation;Journal of Computer and System Sciences;2014-03
2. Reasoning about Actions Meets Strategic Logics;Logic, Rationality, and Interaction;2013
3. Extended Computation Tree Logic;Logic for Programming, Artificial Intelligence, and Reasoning;2010