Automatic Constrained Rewriting Induction towards Verifying Procedural Programs

Abstract

AbstractThis paper aims at developing a verification method for procedural programs via a transformation into logically constrained term rewriting systems (LCTRSs). To this end, we adapt existing rewriting induction methods to LCTRSs and propose a simple yet effective method to generalize equations. We show that we can handle realistic functions, involving, e.g., integers and arrays. An implementation is provided.KeywordsInference RuleFunction SymbolInduction RuleLogical TermGround TermThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.