A formal approach to program inversion

Authors:
Wei Chen
Affiliations:
Department of Computer Science, Campus Box 1045, Washington University, Saint Louis, MO
Venue:
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Year:
1990

Citing 8
Cited 2

An algorithm for transitive reduction of an acyclic graph

Science of Computer Programming
Inorder traversal of a binary tree and its inversion

Formal development programs and proofs
Program inversion: more than fun!

Science of Computer Programming
The Science of Programming

The Science of Programming
Selected writings on computing: a personal perspective

Selected writings on computing: a personal perspective
Mathematical Theory of Program Correctness

Mathematical Theory of Program Correctness
A Discipline of Programming

A Discipline of Programming
A Method of Programming

A Method of Programming

Designing an algorithmic proof of the two-squares theorem

MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Path-based inductive synthesis for program inversion

Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a formal approach to inverting programs, which is developed in [2]. We demonstrate its usefulness in programming by applying it to develop an in-place algorithm for the so-called LU-multiplication, which might be otherwise hard to find.