Towards Verifying Procedural Programs using Constrained Rewriting Induction.
Cynthia Kop, Naoki Nishida · arXiv (Cornell University) · 2014
Abstract. This paper aims at developing a verification method for procedural programs via a transformation into the recently introduced logically constrained term rewriting systems (LCTRSs). To this end, we introduce an extension of transformation methods based on integer TRSs, which can also handle global variables and arrays, and encode safety checks. Then we adapt existing rewriting induction methods to LCTRSs and propose a simple yet effective method to generalize equations. We show that we can automatically verify memory safety and prove correctness of realistic functions, involving for instance integers and arrays. 1