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:
Accés en línia:Citation/Abstract
Full text outside of ProQuest
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!

MARC

LEADER 00000nab a2200000uu 4500
001 2075531248
003 UK-CbPIL
022 |a 2331-8422 
035 |a 2075531248 
045 0 |b d20170225 
100 1 |a Fuhs, Carsten 
245 1 |a Verifying Procedural Programs via Constrained Rewriting Induction 
260 |b Cornell University Library, arXiv.org  |c Feb 25, 2017 
513 |a Working Paper 
520 3 |a 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. 
653 |a Transformations (mathematics) 
653 |a Program verification (computers) 
653 |a Mathematical analysis 
653 |a Safety 
653 |a Computer programming 
653 |a Specification and description languages 
700 1 |a Kop, Cynthia 
700 1 |a Nishida, Naoki 
773 0 |t arXiv.org  |g (Feb 25, 2017), p. n/a 
786 0 |d ProQuest  |t Engineering Database 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/2075531248/abstract/embedded/6A8EOT78XXH2IG52?source=fedsrch 
856 4 0 |3 Full text outside of ProQuest  |u http://arxiv.org/abs/1409.0166