InvX: An automatic function inverter

Khoshnevisan, Hessam; Sephton, K. M.

doi:10.1007/3-540-51081-8_139

Cited by 14 publications

(5 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Inversion of functional programs has been stud-ied in [7,11,27,31,33,39,42]. Experiments with program inversion using specialization systems are reported in [22,40,19,35].…”

Section: Related Workmentioning

confidence: 99%

Principles of Inverse Computation and the Universal Resolving Algorithm

Abramov

Glück

2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We survey fundamental concepts in inverse programming and present the Universal Resolving Algorithm (URA), an algorithm for inverse computation in a first-order, functional programming language. We discuss the principles behind the algorithm, including a three-step approach based on the notion of a perfect process tree, and demonstrate our implementation with several examples. We explain the idea of a semantics modifier for inverse computation which allows us to perform inverse computation in other programming languages via interpreters.On leave from DIKU,

show abstract

“…Inversion of functional programs has been stud-ied in [7,11,27,31,33,39,42]. Experiments with program inversion using specialization systems are reported in [22,40,19,35].…”

Section: Related Workmentioning

confidence: 99%

Principles of Inverse Computation and the Universal Resolving Algorithm

Abramov

Glück

2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The logical variables are removed from the program at transformation-time and thus the execution mechanism remains conventional reduction. InvX, a mechanized system for function inversion, is described by Khoshnevisan and Sephton (1989).…”

Section: Transformation Schemesmentioning

confidence: 99%

An overview of the Flagship system

Keane

1994

J. Funct. Prog.

View full text Add to dashboard Cite

The Flagship Project1 was a research collaboration between the University of Manchester, Imperial College London and International Computers Ltd. The project was unusual in that it aimed to produce a complete computing system based on a declarative programming style. Three areas of a declarative system were addressed: (1) programming languages and programming environments; (2) the machine architecture and computational models; and (3) the software environment. This overview paper discusses each of these areas, the intention being to present the project as a coherent whole.

show abstract

“…In this work, we focus on the so called deterministic conditional rewrite systems (DCTRSs), which are typical functional programs with local declarations [23]. When the rewrite systems are automatically generated (e.g., by program inversion [2,14,15,17,22,27,26,28] or partial evaluation [1,7,8,35]), they often have a poor syntactic structure that might hide some properties. For instance, the rewriting systems generated by program inversion sometimes have overlapping left-hand sides despite the fact that they actually have the unique normal form property w.r.t.…”

Section: Introductionmentioning

confidence: 99%

Computing More Specific Versions of Conditional Rewriting Systems

Nishida

Vidal

2013

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

Abstract. Rewrite systems obtained by some automated transformation often have a poor syntactic structure even if they have good properties from a semantic point of view. For instance, a rewrite system might have overlapping left-hand sides even if it can only produce at most one constructor normal form (i.e., value). In this paper, we propose a method for computing "more specific" versions of deterministic conditional rewrite systems (i.e., typical functional programs) by replacing a given rule (e.g., an overlapping rule) with a finite set of instances of this rule. In some cases, the technique is able to produce a non-overlapping system from an overlapping one. We have applied the transformation to improve the systems produced by a previous technique for function inversion with encouraging results (all the overlapping systems were successfully transformed to non-overlapping systems).

show abstract

InvX: An automatic function inverter

Cited by 14 publications

References 3 publications

Principles of Inverse Computation and the Universal Resolving Algorithm

Principles of Inverse Computation and the Universal Resolving Algorithm

An overview of the Flagship system

Computing More Specific Versions of Conditional Rewriting Systems

Contact Info

Product

Resources

About