Verifying Procedural Programs via Constrained Rewriting Induction

Guardat en:

Dades bibliogràfiques
Publicat a:	arXiv.org (Feb 25, 2017), p. n/a
Autor principal:	Fuhs, Carsten
Altres autors:	Kop, Cynthia, Nishida, Naoki
Publicat:	Cornell University Library, arXiv.org
Matèries:	Transformations (mathematics) Program verification (computers) Mathematical analysis Safety Computer programming Specification and description languages
Accés en línia:	Citation/Abstract Full text outside of ProQuest
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!

Descripció
Resum:	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
Font:	Engineering Database