Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Reference31 articles.
1. Daedalus. Available on: http://www.di.ens.fr/ cousot/projects/DAEDALUS/index.shtml. P.A. Abdulla, Y.-F. Chen, L. Holík, R. Mayr, and T. Vojnar. When simulation meets antichains. InTools and Algorithms for the Construction and Analysis of Systems, volume 6015 ofLecture Notes in Computer Science, pages 158-174. Springer, 2010.
2. Size-Change Termination, Monotonicity Constraints and Ranking Functions
3. A.M. Ben-Amram and C.S. Lee. Program termination analysis in polynomial time.ACM Trans. Program. Lang. Syst., 29:5:1-5:37, January 2007.
4. J.R. Büchi. On a decision method in restricted second order arithmetic. InProc. Int. Congress on Logic, Method, and Philosophy of Science. 1960, pages 1-12. Stanford University Press, 1962.
5. Theories of automata on ω-tapes: A simplified approach
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the power of finite ambiguity in Büchi complementation;Information and Computation;2023-06
2. Towards a Grand Unification of Büchi Complementation Constructions;Lecture Notes in Computer Science;2022
3. On the Power of Unambiguity in Büchi Complementation;Electronic Proceedings in Theoretical Computer Science;2020-09-20
4. Advanced automata-based algorithms for program termination checking;Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation;2018-06-11
5. Buffered Simulation Games for Büchi Automata;Electronic Proceedings in Theoretical Computer Science;2014-05-21