Reproduce “Outrunning Big KATs: Efficient Decision Procedures for Variants of GKAT” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Cheng Zhang, Qiancheng Fu, Hang Ji, Ines Santacruz Del Valle, Alexandra Silva, Marco Gaboardi
The authors develop an on-the-fly checker for finite-trace equivalence of control-flow programs. It compares reachable behaviors while generating them, grouping test assignments into Boolean formulas and reasoning with SAT or BDD solvers. On 237 GNU Coreutils functions, both symbolic variants checked almost all in approximately 7 seconds and under 100 MB. This supports practical control-flow checking, not general KAT equivalence.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.