Image de couverture de livre

Verifying Procedural Programs via Constrained Rewriting Induction

Enregistré dans:
Publié dans:arXiv.org (Feb 25, 2017), p. n/a
Auteur principal: Fuhs, Carsten
Autres auteurs: Kop, Cynthia, Nishida, Naoki
Publié:
Cornell University Library, arXiv.org
Sujets:
Transformations (mathematics)
Program verification (computers)
Mathematical analysis
Safety
Computer programming
Specification and description languages
Accès en ligne:Citation/Abstract
Full text outside of ProQuest
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
Résumé:This paper aims to develop a verification method for procedural programs via a transformation into Logically Constrained Term Rewriting Systems (LCTRSs). To this end, we extend transformation methods based on integer TRSs to handle arbitrary data types, global variables, function calls and arrays, as well as 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. Our approach proves equivalence between two implementations, so in contrast to other works, we do not require an explicit specification in a separate specification language.
ISSN:2331-8422
Source:Engineering Database