B\"uchi Complementation and Size-Change Termination
Seth Fogarty (Department of Computer Science, Rice University,, Houston, TX), Moshe Y. Vardi (Department of Computer Science, Rice, University, Houston, TX)

TL;DR
This paper compares B"uchi automata complementation methods with a size-change termination algorithm, revealing that Ramsey-based approaches outperform rank-based methods in practice for SCT problems, despite worse theoretical bounds.
Contribution
It demonstrates that the size-change termination algorithm is a specialized form of Ramsey-based B"uchi automata complementation, and improves rank-based tools based on new insights.
Findings
Ramsey-based approaches outperform rank-based methods on SCT problems.
Empirical analysis confirms practical superiority despite theoretical complexity.
Enhanced rank-based tools show improved empirical performance.
Abstract
We compare tools for complementing nondeterministic B\"uchi automata with a recent termination-analysis algorithm. Complementation of B\"uchi automata is a key step in program verification. Early constructions using a Ramsey-based argument have been supplanted by rank-based constructions with exponentially better bounds. In 2001 Lee et al. presented the size-change termination (SCT) problem, along with both a reduction to B\"uchi automata and a Ramsey-based algorithm. The Ramsey-based algorithm was presented as a more practical alternative to the automata-theoretic approach, but strongly resembles the initial complementation constructions for B\"uchi automata. We prove that the SCT algorithm is a specialized realization of the Ramsey-based complementation construction. To do so, we extend the Ramsey-based complementation construction to provide a containment-testing algorithm.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
