3 citations found. Retrieving documents...
H. Khoshnevisan, K. M. Sephton. InvX: An automatic function inverter. In N. Dershowitz (ed.), Rewriting Techniques and Applications. Proceedings, LNCS 355, 564--

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
A Calculational Approach to Program Inversion - Linacre (2003)   (1 citation)  (Correct)

....aim at producing an optimised algorithm by hand. As a consequence, the derivation usually works in a case by case basis and human inspiration is an essential part of the derivation. In contrast, e#orts have also been made on automatically performing inversion for programs in general, such as in [74, 49, 2]. In [2] two di#erent approaches toward inversion were distinguished: the aim of inverse computation is to determine what inputs would deliver in a certain output, while inverse compilation or program inversion aims at producing a program performing the inverse task of a given program. In this ....

....program derivation. Consequently, our aim is not, say, to answer which binary tree yields a particular pair of prefix and infix traversals; rather, we are interested in producing algorithms that answer the question. Researchers from the field of partial evaluation took complementary approaches [74, 49, 2]. In [2] Abramov and Gluck attempted at a universal method to inverse computation via an inverse interpreter. At the core of their approach is a flexible, finite representation 8.6. REVERSIBLE COMPUTATION AND QUANTUM COMPUTING 131 of possibly infinite sets. Here is a sketch how the inverse ....

H. Khoshnevisan and K. M. Stephton. InvX: an automatic function inverter. In N. Dershowitz, editor, Rewriting Techniques and Applications (RTA '89), number 792 in Lecture Notes in Computer Science, pages 564--568. Springer-Verlag, 1989.


The Universal Resolving Algorithm: Inverse Computation in a.. - Abramov, Glück (2000)   (11 citations)  (Correct)

.... concept in any programming language, e.g. if one direction of an algorithm is easier to define than the other, or if both directions are needed (cf. encoding and decoding) Interestingly, inversion has spanned relatively little interest in the area of functional programming (exceptions are [5, 9, 18, 20, 21, 25]) even though it is an essential concept in mathematics. We distinguish between two approaches for solving inversion problems: an inverse interpreter that performs inverse computation and an inverse compiler that performs program inversion. Determining for a given program P and output y an ....

....methods for deriving the inverse program. For example, the technique suggested in [7] provides for inverting programs symbolically, but requires that the programmer provide inductive assertions on conditionals and loop statements. Few papers have been devoted to inversion of functional programs [5, 9, 18, 20, 21, 25] in a similar manner, sometimes automatically. The work in functional languages is usually on program inversion. An automatic system for synthesizing recursive programs from first order functional programs is InvX [20] The inverse of functions has been paid attention to, at least conceptually, in ....

[Article contains additional citation context not shown here]

H. Khoshnevisan, K. M. Sephton. InvX: An automatic function inverter. In N. Dershowitz (ed.), Rewriting Techniques and Applications (RTA'89), LNCS 355, 564--


A Program Inverter for a Functional Language with Equality and .. - Glück, Kawabe (2003)   (Correct)

No context found.

H. Khoshnevisan, K. M. Sephton. InvX: An automatic function inverter. In N. Dershowitz (ed.), Rewriting Techniques and Applications. Proceedings, LNCS 355, 564--

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC