Author:
Bouajjani Ahmed,Habermehl Peter,Mayr Richard
Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. Reachability analysis of pushdown automata;Bouajjani,1997
2. Diophantine equations, presburger arithmetic and finite automata;Boudet,1996
3. Pushdown processes;Burkart,1994
4. Model checking the full modal mu-calculus for infinite sequential processes;Burkart,1997
5. J. Esparza, D. Hansel, P. Rossmanith, S. Schwoon, Efficient algorithms for model checking pushdown systems, in: Proc. of CAV 2000, Lecture Notes in Computer Science, Vol. 1855, Springer, Berlin, 2000.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献