Delwedd Flaen

Verifying Procedural Programs via Constrained Rewriting Induction

Wedi'i Gadw mewn:
Cyhoeddwyd yn:arXiv.org (Feb 25, 2017), p. n/a
Prif Awdur: Fuhs, Carsten
Awduron Eraill: Kop, Cynthia, Nishida, Naoki
Cyhoeddwyd:
Cornell University Library, arXiv.org
Pynciau:
Transformations (mathematics)
Program verification (computers)
Mathematical analysis
Safety
Computer programming
Specification and description languages
Mynediad Ar-lein:Citation/Abstract
Full text outside of ProQuest
Tagiau: Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
Crynodeb: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
Ffynhonnell:Engineering Database