🤖 AI Summary
This work addresses the automated verification of confluence (and non-confluence) and termination for Logic-Constrained Rewrite Systems (LCRSs). Methodologically, we propose CREST, a unified analysis framework integrating SMT solving, symbolic execution, and rewriting semantics to enable precise modeling and property derivation of rewrite rules under first-order logical constraints. Our key contribution is the first end-to-end automated verification framework capable of handling LCRSs with complex logical conditions—including inequalities and existential quantifiers—thereby overcoming the fundamental limitation of conventional rewriting tools, which only support unconstrained rules. Evaluated on diverse benchmarks, CREST achieves significantly higher accuracy, broader coverage, and superior scalability compared to state-of-the-art tools. It successfully verifies realistic LCRSs arising in program analysis and theorem prover preprocessing, demonstrating both practical applicability and theoretical advancement in constrained rewriting.
📝 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.