Artículo
Constructing Recursions by Similarity
Autor/es | Galán Morillo, Francisco José
Cañete Valdeón, José Miguel Díaz Madrigal, Víctor Jesús |
Departamento | Universidad de Sevilla. Departamento de Lenguajes y Sistemas Informáticos |
Fecha de publicación | 2003 |
Fecha de depósito | 2020-06-18 |
Publicado en |
|
Resumen | A formal specification can describe software models
which are difficult to program. Transformational methods
based on fold/unfold strategies have been proposed to
palliate this problem. The objective of applying
tran ... A formal specification can describe software models which are difficult to program. Transformational methods based on fold/unfold strategies have been proposed to palliate this problem. The objective of applying transformations is to filter out a new version of the specification where recursion may be introduced by a folding step. Among many problems, the “eureka” about when and how to define a new predicate is difficult to find automatically. We propose a new version of the folding rule which decides automatically how to introduce new predicates in a specification. Our method is based on finding similarities between formulas represented as parsing trees and it constitutes an assistance to the complex problem of deriving recursive specifications from non recursive ones. |
Cita | Galán Morillo, F.J., Cañete Valdeón, J.M. y Díaz Madrigal, V.J. (2003). Constructing Recursions by Similarity. Journal of the Brazilian Computer Society, 9 (1) |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Constructing Recursions by ... | 663.3Kb | [PDF] | Ver/ | |