Verifying Procedural Programs via Constrained Rewriting Induction

Gorde:

Xehetasun bibliografikoak
Argitaratua izan da:	arXiv.org (Feb 25, 2017), p. n/a
Egile nagusia:	Fuhs, Carsten
Beste egile batzuk:	Kop, Cynthia, Nishida, Naoki
Argitaratua:	Cornell University Library, arXiv.org
Gaiak:	Transformations (mathematics) Program verification (computers) Mathematical analysis Safety Computer programming Specification and description languages
Sarrera elektronikoa:	Citation/Abstract Full text outside of ProQuest
Etiketak:	Etiketa erantsi Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!

Deskribapena
Laburpena:	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
Baliabidea:	Engineering Database