Constructing recursions by similarity

Journal of the Brazilian Computer Society

Madrigal, V. J. Diaz¹  Galán, F. J.¹  Cañete, J. M.¹  Faculty of Computer Science of Seville¹ 

关键词: specification transformation;    program synthesis;    correctness preservation;    program specification.;   

DOI  :  10.1590/S0104-65002003000200003

学科分类：农业科学（综合）

来源: Springer U K

【 摘 要 】

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.

【 授权许可】

Unknown