SciELO - Scientific Electronic Library Online

 
vol.9 issue1A representation for the modules of a graph and applicationsMímico: a monadic combinator parser generator author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Journal of the Brazilian Computer Society

Print version ISSN 0104-6500

Abstract

GALAN, F. J.; CANETE, J. M.  and  MADRIGAL, V. J. Diaz. Constructing recursions by similarity. J. Braz. Comp. Soc. [online]. 2003, vol.9, n.1, pp. 17-26. ISSN 0104-6500.  http://dx.doi.org/10.1590/S0104-65002003000200003.

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.

Keywords : specification transformation; program synthesis; correctness preservation; program specification.

        · text in English     · pdf in English