Combining Theorem Proving with Model Checking through Predicate Abstraction
Sandip Kumar Ray, Rob Sumners · IEEE Design & Test of Computers · 2007
Using theorem-based approaches to prove the invariants of infinite-state reactive systems often demands significant manual involvement. This article presents a new approach in which model checking complements theorem proving, reducing the manual effort involved by transferring user attention from defining inductive invariants to proving rewrite rules. The authors use this approach with ACL2 to verify cache coherence protocols.