Molina, FacundoCornejo, CésarDegiovanni, RenzoRegis, GermánCastro, PabloAguirre, NazarenoFrías, Marcelo2020-01-062020-01-062019-070167-6423http://ri.itba.edu.ar/handle/123456789/1853"Various tools for program analysis, including run-time assertion checkers and static analyzers such as verification and test generation tools, require formal specifications of the programs being analyzed. Moreover, many of these tools and techniques require such specifications to be written in a particular style, or follow certain patterns, in order to obtain an acceptable performance from the corresponding analyses. Thus, having a formal specification sometimes is not enough for using a particular technique, since such specification may not be provided in the right formalism. In this paper, we deal with this problem in the increasingly common case of having an operational specification, while for analysis reasons requiring a declarative specification. We propose an evolutionary approach to translate an operational specification written in a sequential programming language, into a declarative specification, in relational logic. We perform experiments on a benchmark of data structure implementations, for which operational invariants are available, and show that our evolutionary computation based approach to translating specifications achieves very good precision in this context, and produces declarative specifications that are more amenable to analyses that demand specifications in this style. This is assessed in two contexts: bounded verification of data structure invariant preservation, and instance enumeration using symbolic execution aided by tight bounds."enESTRUCTURA DE DATOSVERIFICACION DE SOFTWARETEORIA DE LA COMPUTACIONALGORITMOS EVOLUTIVOSArtículos de Publicaciones Periódicas