Automated Analysis of Logically Constrained Rewrite Systems using crest
arXiv:2501.05240 · doi:10.1007/978-3-031-90643-5_7
Abstract
We present crest, a tool for automatically proving (non-)confluence and termination of logically constrained rewrite systems. We compare crest to other tools for logically constrained rewriting. Extensive experiments demonstrate the promise of crest.
Accepted at the 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS) 2025