Author:
Ibarra Oscar H.,Su Jianwen,Dang Zhe,Bultan Tevfik,Kemmerer Richard A.
Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. Verifying programs with unreliable channels;Abdulla;Inform. Comput.,1996
2. A theory of timed automata;Alur;Theoret. Comput. Sci.,1994
3. Reversal-bounded multipushdown machines;Baker;J. Comput. System Sci.,1974
4. A. Bouajjani, J. Esparza, O. Maler, Reachability analysis of pushdown automata: application to model-checking, Proc. Internat. Conf. on Concurrency (CONCUR 1997), Lecture Notes in Computer Science, Vol. 1243, Springer, Berlin, 1997, pp. 135–150.
5. G. Cece, A. Finkel, Programs with quasi-stable channels are effectively recognizable, Proc. 9th Internat. Conf. on Computer Aided Verification (CAV 1997), Lecture Notes in Computer Science, Vol. 1254, Springer, Berlin, 1997, pp. 304–315.
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献