In this paper, we continue the work on the formal approach to program inversion by presenting programming laws for specifying the inverse program according to the specification of its forward program, and for inverting recursive procedues. The formal establishment of these laws, once more, convinces us that program inversion has nice mathematical properties that can be used in formal program development. Some examples are included to illustrate the usage of the laws developed in this paper
As an example of the transformational programming method, a previously unknown algo- rithm for cal...
We present a formal derivation of program schemes that are usually called Backtracking programs and ...
Abstract. We introduce a new partial inversion technique for first-order functional programs. Our te...
AbstractWe introduce proof rules for inverting a program. We derive an algorithm to compute the preo...
Program inversion is a fundamental problem that has been addressed in many different programming set...
Abstract. We present a method for automatic program inversion in a first-order functional programmin...
Different languages provide control structures with different kinds of flexibility. For example, CLU...
Morgan's approach to program development is a refinement calculus: using this method, programs are d...
Formal methods in software development provide many benefits in the forward engineering aspect of so...
Peer-reviewed. received 16th March 1999; accepted 8th September 1999The transformation of a recursi...
. In the proofs as programs methodology a program is derived from a formal constructive proof. Becau...
Abstract. Program inversion has many applications such as in the im-plementation of serialization/de...
The design of recursive functions is a well-studied subject. Design methods require a specification ...
Abstract. Program inversion has many applications such as in the im-plementation of serialization/de...
Many problems in computation can be specified in terms of computing the inverse of an easily constru...
As an example of the transformational programming method, a previously unknown algo- rithm for cal...
We present a formal derivation of program schemes that are usually called Backtracking programs and ...
Abstract. We introduce a new partial inversion technique for first-order functional programs. Our te...
AbstractWe introduce proof rules for inverting a program. We derive an algorithm to compute the preo...
Program inversion is a fundamental problem that has been addressed in many different programming set...
Abstract. We present a method for automatic program inversion in a first-order functional programmin...
Different languages provide control structures with different kinds of flexibility. For example, CLU...
Morgan's approach to program development is a refinement calculus: using this method, programs are d...
Formal methods in software development provide many benefits in the forward engineering aspect of so...
Peer-reviewed. received 16th March 1999; accepted 8th September 1999The transformation of a recursi...
. In the proofs as programs methodology a program is derived from a formal constructive proof. Becau...
Abstract. Program inversion has many applications such as in the im-plementation of serialization/de...
The design of recursive functions is a well-studied subject. Design methods require a specification ...
Abstract. Program inversion has many applications such as in the im-plementation of serialization/de...
Many problems in computation can be specified in terms of computing the inverse of an easily constru...
As an example of the transformational programming method, a previously unknown algo- rithm for cal...
We present a formal derivation of program schemes that are usually called Backtracking programs and ...
Abstract. We introduce a new partial inversion technique for first-order functional programs. Our te...