Results 1 
3 of
3
A Transformation System for Developing Recursive Programs
, 1977
"... A system of rules for transforming programs is described, with the programs in the form of recursion equations An initially very simple, lucid. and hopefully correct program IS transformed into a more efficient one by altering the recursion structure Illustrative examples of program transformations ..."
Abstract

Cited by 653 (3 self)
 Add to MetaCart
A system of rules for transforming programs is described, with the programs in the form of recursion equations An initially very simple, lucid. and hopefully correct program IS transformed into a more efficient one by altering the recursion structure Illustrative examples of program transformations are given, and a tentative implementation !s described Alternative structures for programs are shown, and a possible initial phase for an automatic or semiautomatic program manipulation system is lndmated KEY WORDS AND PHRASES program transformation, program mampulatlon, optimization, recursion CR CATEGORIES' 3 69, 4 12, 4 22, 5 24, 5 25 1.
ContextMoving Transformations for Function Verification
, 1999
"... Several induction theorem provers have been developed which support mechanized verification of functional programs. Unfortunately, a major problem is that they often fail in verifying tail recursive functions (which correspond to imperative programs). However, in practice imperative programs are ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Several induction theorem provers have been developed which support mechanized verification of functional programs. Unfortunately, a major problem is that they often fail in verifying tail recursive functions (which correspond to imperative programs). However, in practice imperative programs are used almost exclusively. We present an automatic transformation to tackle this problem. It transforms functions which are hard to verify into functions whose correctness can be shown by the existing provers. In contrast to classical program transformations, the aim of our technique is not to increase efficiency, but to increase veriability. Therefore, this paper introduces a novel application area for program transformations and it shows that such techniques can in fact solve some of the most urgent current challenge problems in automated verification and induction theorem proving.
unknown title
"... This paper is concerned with the problem of generalization heuristics, which are incorporated into our verification system for Prolog programs. Two kinds of generalization are discussed, that is, a mechanical generalisation and an intelligent generalization. We show that the mechanical generalizatio ..."
Abstract
 Add to MetaCart
(Show Context)
This paper is concerned with the problem of generalization heuristics, which are incorporated into our verification system for Prolog programs. Two kinds of generalization are discussed, that is, a mechanical generalisation and an intelligent generalization. We show that the mechanical generalization used in BoyerMoore*s theorem prover (BMTP) can be performed by the simplification rule of our verification system, as well as in the case of crossfertilization. To the intelligent generalization heuristic, which is not employed in BMTP, we give a generalization scheme which is naturally incorporated into our inference system of the extendedexecution style of the Prolog interpreter, and which proves to be effective also for flawed induction schemes. I.