Verifying Procedural Programs via Constrained Rewriting Induction

Uloženo v:

Podrobná bibliografie
Vydáno v:	arXiv.org (Feb 25, 2017), p. n/a
Hlavní autor:	Fuhs, Carsten
Další autoři:	Kop, Cynthia, Nishida, Naoki
Vydáno:	Cornell University Library, arXiv.org
Témata:	Transformations (mathematics) Program verification (computers) Mathematical analysis Safety Computer programming Specification and description languages
On-line přístup:	Citation/Abstract Full text outside of ProQuest
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Abstrakt:	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
Zdroj:	Engineering Database