Subject
General Computer Science,Theoretical Computer Science
Reference11 articles.
1. P. Aziz Abdulla, K. Cerans, B. Jonsson, and T. Yih-Kuen. General decidability theorems for infinite-state systems. In 10th Annual IEEE Symp. on Logic in Computer Science (LICS'96), pages 313–321, 1996
2. J. Bingham. A new approach to upward-closed set backward reachability analysis. Technical report, University of British Columbia Department of Computer Science, 2004. TR-2004-07
3. Graph-based algorithms for boolean function manipulation;Bryant;IEEE Trans. on Computers,1986
4. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. In Conf. on Logic in Computer Science, pages 428–439, 1990
5. G. Delzanno and J.F. Raskin. Symbolic representation of upward-closed sets. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 7th Int'l Conf., pages 426–440, 2000
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献