Publisher
Springer International Publishing
Reference24 articles.
1. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (LICS 1996), pp. 313–321. IEEE Computer Society (1996)
2. Lecture Notes in Computer Science;PA Abdulla,2010
3. Bonchi, F., Ganty, P., Giacobazzi, R., Pavlovic, D.: Sound up-to techniques and complete abstract domains. In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2018). ACM Press (2018)
4. Bonchi, F., Pous, D.: Checking NFA equivalence with bisimulations up to congruence. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2013), pp. 457–468. ACM Press (2013)
5. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);P Cousot,2000
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Antichains Algorithms for the Inclusion Problem Between $$\omega $$-VPL;Tools and Algorithms for the Construction and Analysis of Systems;2023
2. Complete Abstractions for Checking Language Inclusion;ACM Transactions on Computational Logic;2021-10-31