High-performance deduction for verification: a case study in the theory of arrays
Alessandro Armando, Maria Paola Bonacina, Aditya Kumar Sehgal, Silvio Ranise · 2002
We outline an approach to use ordering-based theorem-proving strategies as satisfiability procedures for certain decidable theories. We report on experiments with synthetic benchmarks in the theory of arrays with extensionality, showing that a theorem prover -- the E system -- compares favorably with the state-of-the-art validity checker CVC.