Bridging Arrays and ADTs in Recursive Proofs

We present an approach to synthesize relational invariants to prove equivalences between object-oriented programs. The approach bridges the gap between recursive data types and arrays that serve to represent internal states. Our relational invariants are recursively-defined, and thus are valid for d...

Descripción completa

Detalles Bibliográficos
Autores principales: Fedyukovich, Grigory, Ernst, Gidon
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2021
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7984558/
http://dx.doi.org/10.1007/978-3-030-72013-1_2
_version_ 1783668090890878976
author Fedyukovich, Grigory
Ernst, Gidon
author_facet Fedyukovich, Grigory
Ernst, Gidon
author_sort Fedyukovich, Grigory
collection PubMed
description We present an approach to synthesize relational invariants to prove equivalences between object-oriented programs. The approach bridges the gap between recursive data types and arrays that serve to represent internal states. Our relational invariants are recursively-defined, and thus are valid for data structures of unbounded size. Based on introducing recursion into the proofs by observing and lifting the constraints from joint methods of the two objects, our approach is fully automatic and can be seen as an algorithm for solving Constrained Horn Clauses (CHC) of a specific sort. It has been implemented on top of the SMT-based CHC solver AdtChc and evaluated on a range of benchmarks.
format Online
Article
Text
id pubmed-7984558
institution National Center for Biotechnology Information
language English
publishDate 2021
record_format MEDLINE/PubMed
spelling pubmed-79845582021-03-23 Bridging Arrays and ADTs in Recursive Proofs Fedyukovich, Grigory Ernst, Gidon Tools and Algorithms for the Construction and Analysis of Systems Article We present an approach to synthesize relational invariants to prove equivalences between object-oriented programs. The approach bridges the gap between recursive data types and arrays that serve to represent internal states. Our relational invariants are recursively-defined, and thus are valid for data structures of unbounded size. Based on introducing recursion into the proofs by observing and lifting the constraints from joint methods of the two objects, our approach is fully automatic and can be seen as an algorithm for solving Constrained Horn Clauses (CHC) of a specific sort. It has been implemented on top of the SMT-based CHC solver AdtChc and evaluated on a range of benchmarks. 2021-02-26 /pmc/articles/PMC7984558/ http://dx.doi.org/10.1007/978-3-030-72013-1_2 Text en © The Author(s) 2021 Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made. The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
spellingShingle Article
Fedyukovich, Grigory
Ernst, Gidon
Bridging Arrays and ADTs in Recursive Proofs
title Bridging Arrays and ADTs in Recursive Proofs
title_full Bridging Arrays and ADTs in Recursive Proofs
title_fullStr Bridging Arrays and ADTs in Recursive Proofs
title_full_unstemmed Bridging Arrays and ADTs in Recursive Proofs
title_short Bridging Arrays and ADTs in Recursive Proofs
title_sort bridging arrays and adts in recursive proofs
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7984558/
http://dx.doi.org/10.1007/978-3-030-72013-1_2
work_keys_str_mv AT fedyukovichgrigory bridgingarraysandadtsinrecursiveproofs
AT ernstgidon bridgingarraysandadtsinrecursiveproofs

Ejemplares similares