We present a bounded equivalence verification technique for higher-order programs with local state that combines fully abstract symbolic environmental bisimulations similar to symbolic game models, novel up-to techniques which are effective in practice even when terms diverge, and lightweight invariant annotations. The combination yields an equivalence checking technique with no false positives or negatives where all inequivalences can be automatically detected, and many equivalences can be automatically or semi-automatically proved, including all classical Meyer and Sieber equivalences. We realise the technique in a tool prototype called Hobbit and benchmark it with an extensive set of new and existing examples.

中文翻译：

---

反复进行：从有限检查到通过符号最新技术验证程序等效性

我们提出了一种具有局部状态的高阶程序的有界等效验证技术，该技术结合了类似于符号游戏模型的完全抽象的符号环境双模拟，即使在术语出现分歧时仍有效的新颖最新技术以及轻量级不变注释。这种组合产生了一种等效检查技术，没有假阳性或阴性，可以自动检测到所有不等式，并且可以自动或半自动证明许多等效项，包括所有经典的Meyer和Sieber等效项。我们在称为Hobbit的工具原型中实现了该技术，并通过大量新的和现有的示例对其进行了基准测试。